./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e71601c55174be0ad57296dccc2279fd85b1f2c03bb5913dfcee88384188d311 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:47:54,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:47:54,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:47:54,484 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:47:54,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:47:54,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:47:54,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:47:54,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:47:54,509 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:47:54,512 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:47:54,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:47:54,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:47:54,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:47:54,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:47:54,513 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:47:54,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:47:54,513 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:47:54,513 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:47:54,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:47:54,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:47:54,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:47:54,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:47:54,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:47:54,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:47:54,516 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:47:54,516 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:47:54,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:47:54,516 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:47:54,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:47:54,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:47:54,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:47:54,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:47:54,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:47:54,517 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:47:54,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:47:54,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:47:54,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:47:54,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:47:54,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:47:54,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:47:54,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:47:54,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:47:54,519 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e71601c55174be0ad57296dccc2279fd85b1f2c03bb5913dfcee88384188d311 [2024-10-13 00:47:54,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:47:54,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:47:54,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:47:54,777 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:47:54,778 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:47:54,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-59.i [2024-10-13 00:47:55,948 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:47:56,132 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:47:56,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-59.i [2024-10-13 00:47:56,145 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17dd4085f/11f6fc804f584f78bd0b5e6de18da686/FLAG7ea4b8d26 [2024-10-13 00:47:56,157 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17dd4085f/11f6fc804f584f78bd0b5e6de18da686 [2024-10-13 00:47:56,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:47:56,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:47:56,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:47:56,163 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:47:56,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:47:56,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:47:56" (1/1) ... [2024-10-13 00:47:56,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@638292cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:56, skipping insertion in model container [2024-10-13 00:47:56,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:47:56" (1/1) ... [2024-10-13 00:47:56,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:47:56,321 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-59.i[915,928] [2024-10-13 00:47:56,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:47:56,375 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:47:56,386 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-59.i[915,928] [2024-10-13 00:47:56,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:47:56,429 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:47:56,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:56 WrapperNode [2024-10-13 00:47:56,431 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:47:56,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:47:56,433 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:47:56,433 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:47:56,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:56" (1/1) ... [2024-10-13 00:47:56,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:56" (1/1) ... [2024-10-13 00:47:56,485 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2024-10-13 00:47:56,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:47:56,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:47:56,490 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:47:56,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:47:56,498 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:56" (1/1) ... [2024-10-13 00:47:56,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:56" (1/1) ... [2024-10-13 00:47:56,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:56" (1/1) ... [2024-10-13 00:47:56,520 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:47:56,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:56" (1/1) ... [2024-10-13 00:47:56,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:56" (1/1) ... [2024-10-13 00:47:56,527 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:56" (1/1) ... [2024-10-13 00:47:56,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:56" (1/1) ... [2024-10-13 00:47:56,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:56" (1/1) ... [2024-10-13 00:47:56,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:56" (1/1) ... [2024-10-13 00:47:56,538 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:47:56,539 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:47:56,539 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:47:56,539 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:47:56,539 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:56" (1/1) ... [2024-10-13 00:47:56,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:47:56,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:47:56,569 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:47:56,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:47:56,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:47:56,616 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:47:56,616 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:47:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:47:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:47:56,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:47:56,721 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:47:56,723 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:47:57,012 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 00:47:57,012 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:47:57,045 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:47:57,045 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:47:57,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:47:57 BoogieIcfgContainer [2024-10-13 00:47:57,045 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:47:57,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:47:57,048 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:47:57,050 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:47:57,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:47:56" (1/3) ... [2024-10-13 00:47:57,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2694cbd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:47:57, skipping insertion in model container [2024-10-13 00:47:57,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:56" (2/3) ... [2024-10-13 00:47:57,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2694cbd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:47:57, skipping insertion in model container [2024-10-13 00:47:57,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:47:57" (3/3) ... [2024-10-13 00:47:57,052 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-59.i [2024-10-13 00:47:57,065 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:47:57,065 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:47:57,124 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:47:57,131 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7b70a941, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:47:57,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:47:57,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 00:47:57,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 00:47:57,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:47:57,143 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:47:57,144 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:47:57,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:47:57,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1266649107, now seen corresponding path program 1 times [2024-10-13 00:47:57,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:47:57,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775730513] [2024-10-13 00:47:57,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:47:57,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:47:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:47:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:47:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 00:47:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:47:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 00:47:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:47:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 00:47:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:47:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:47:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:47:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:47:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:47:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:47:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:47:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:47:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:47:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 00:47:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 00:47:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 00:47:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:47:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 00:47:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,488 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 00:47:57,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:47:57,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775730513] [2024-10-13 00:47:57,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775730513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:47:57,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:47:57,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:47:57,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602223845] [2024-10-13 00:47:57,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:47:57,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:47:57,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:47:57,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:47:57,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:47:57,512 INFO L87 Difference]: Start difference. First operand has 64 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 00:47:57,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:47:57,544 INFO L93 Difference]: Finished difference Result 125 states and 217 transitions. [2024-10-13 00:47:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:47:57,546 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2024-10-13 00:47:57,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:47:57,554 INFO L225 Difference]: With dead ends: 125 [2024-10-13 00:47:57,554 INFO L226 Difference]: Without dead ends: 62 [2024-10-13 00:47:57,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:47:57,561 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:47:57,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:47:57,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-13 00:47:57,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-13 00:47:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 00:47:57,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 94 transitions. [2024-10-13 00:47:57,623 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 94 transitions. Word has length 135 [2024-10-13 00:47:57,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:47:57,624 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 94 transitions. [2024-10-13 00:47:57,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 00:47:57,625 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 94 transitions. [2024-10-13 00:47:57,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 00:47:57,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:47:57,630 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:47:57,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:47:57,630 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:47:57,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:47:57,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1081310367, now seen corresponding path program 1 times [2024-10-13 00:47:57,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:47:57,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66649208] [2024-10-13 00:47:57,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:47:57,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:47:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:47:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:47:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:57,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 00:47:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:47:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 00:47:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:47:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 00:47:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:47:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:47:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:47:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:47:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:47:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:47:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:47:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:47:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:47:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 00:47:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 00:47:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 00:47:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:47:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 00:47:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,082 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 00:47:58,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:47:58,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66649208] [2024-10-13 00:47:58,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66649208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:47:58,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:47:58,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 00:47:58,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124463773] [2024-10-13 00:47:58,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:47:58,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:47:58,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:47:58,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:47:58,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:47:58,088 INFO L87 Difference]: Start difference. First operand 62 states and 94 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 00:47:58,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:47:58,225 INFO L93 Difference]: Finished difference Result 185 states and 281 transitions. [2024-10-13 00:47:58,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 00:47:58,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2024-10-13 00:47:58,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:47:58,228 INFO L225 Difference]: With dead ends: 185 [2024-10-13 00:47:58,228 INFO L226 Difference]: Without dead ends: 124 [2024-10-13 00:47:58,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:47:58,230 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 60 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:47:58,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 269 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:47:58,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-13 00:47:58,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2024-10-13 00:47:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 61 states have internal predecessors, (76), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 00:47:58,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 160 transitions. [2024-10-13 00:47:58,255 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 160 transitions. Word has length 135 [2024-10-13 00:47:58,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:47:58,257 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 160 transitions. [2024-10-13 00:47:58,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 00:47:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 160 transitions. [2024-10-13 00:47:58,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 00:47:58,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:47:58,260 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:47:58,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 00:47:58,261 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:47:58,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:47:58,262 INFO L85 PathProgramCache]: Analyzing trace with hash -482662553, now seen corresponding path program 1 times [2024-10-13 00:47:58,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:47:58,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409283299] [2024-10-13 00:47:58,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:47:58,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:47:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:47:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:47:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 00:47:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:47:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 00:47:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:47:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 00:47:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:47:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:47:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:47:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:47:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:47:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:47:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:47:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:47:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:47:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 00:47:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 00:47:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 00:47:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:47:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 00:47:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:58,500 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 00:47:58,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:47:58,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409283299] [2024-10-13 00:47:58,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409283299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:47:58,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:47:58,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 00:47:58,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752551761] [2024-10-13 00:47:58,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:47:58,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:47:58,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:47:58,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:47:58,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:47:58,504 INFO L87 Difference]: Start difference. First operand 106 states and 160 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 00:47:58,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:47:58,635 INFO L93 Difference]: Finished difference Result 237 states and 357 transitions. [2024-10-13 00:47:58,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 00:47:58,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 136 [2024-10-13 00:47:58,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:47:58,637 INFO L225 Difference]: With dead ends: 237 [2024-10-13 00:47:58,637 INFO L226 Difference]: Without dead ends: 176 [2024-10-13 00:47:58,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:47:58,639 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 74 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:47:58,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 266 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:47:58,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-13 00:47:58,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 165. [2024-10-13 00:47:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 98 states have (on average 1.2653061224489797) internal successors, (124), 98 states have internal predecessors, (124), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-13 00:47:58,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 250 transitions. [2024-10-13 00:47:58,672 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 250 transitions. Word has length 136 [2024-10-13 00:47:58,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:47:58,673 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 250 transitions. [2024-10-13 00:47:58,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 00:47:58,673 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 250 transitions. [2024-10-13 00:47:58,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 00:47:58,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:47:58,676 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:47:58,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 00:47:58,677 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:47:58,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:47:58,677 INFO L85 PathProgramCache]: Analyzing trace with hash -429560624, now seen corresponding path program 1 times [2024-10-13 00:47:58,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:47:58,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848947303] [2024-10-13 00:47:58,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:47:58,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:47:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:59,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:47:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:59,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:47:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:59,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 00:47:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:59,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:47:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:59,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 00:47:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:59,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:47:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:59,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 00:47:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:59,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:47:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:59,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:47:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:59,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:47:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:59,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:47:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:59,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:47:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:59,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:47:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:59,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:47:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:59,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:47:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:59,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:47:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:59,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 00:47:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:59,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 00:47:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:59,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 00:47:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:59,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:47:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:59,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 00:47:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-13 00:47:59,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:47:59,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848947303] [2024-10-13 00:47:59,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848947303] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:47:59,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381256800] [2024-10-13 00:47:59,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:47:59,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:47:59,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:47:59,158 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 00:47:59,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 00:47:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:59,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 00:47:59,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:47:59,446 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 438 proven. 42 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-10-13 00:47:59,446 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:47:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-13 00:47:59,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381256800] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:47:59,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 00:47:59,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-10-13 00:47:59,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987483976] [2024-10-13 00:47:59,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 00:47:59,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 00:47:59,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:47:59,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 00:47:59,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-13 00:47:59,610 INFO L87 Difference]: Start difference. First operand 165 states and 250 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-10-13 00:48:00,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:48:00,274 INFO L93 Difference]: Finished difference Result 543 states and 769 transitions. [2024-10-13 00:48:00,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-13 00:48:00,275 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 137 [2024-10-13 00:48:00,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:48:00,278 INFO L225 Difference]: With dead ends: 543 [2024-10-13 00:48:00,278 INFO L226 Difference]: Without dead ends: 423 [2024-10-13 00:48:00,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 313 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=399, Invalid=1007, Unknown=0, NotChecked=0, Total=1406 [2024-10-13 00:48:00,280 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 328 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 00:48:00,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 372 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 00:48:00,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-10-13 00:48:00,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 325. [2024-10-13 00:48:00,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 201 states have (on average 1.1741293532338308) internal successors, (236), 203 states have internal predecessors, (236), 105 states have call successors, (105), 18 states have call predecessors, (105), 18 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-13 00:48:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 446 transitions. [2024-10-13 00:48:00,346 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 446 transitions. Word has length 137 [2024-10-13 00:48:00,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:48:00,347 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 446 transitions. [2024-10-13 00:48:00,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-10-13 00:48:00,348 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 446 transitions. [2024-10-13 00:48:00,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 00:48:00,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:48:00,352 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:48:00,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 00:48:00,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:48:00,554 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:48:00,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:48:00,554 INFO L85 PathProgramCache]: Analyzing trace with hash -372302322, now seen corresponding path program 1 times [2024-10-13 00:48:00,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:48:00,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968620840] [2024-10-13 00:48:00,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:48:00,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:48:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 00:48:00,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1405380787] [2024-10-13 00:48:00,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:48:00,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:48:00,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:48:00,666 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 00:48:00,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 00:48:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:48:00,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-13 00:48:00,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:48:01,876 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 210 proven. 144 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-10-13 00:48:01,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:48:07,519 WARN L286 SmtUtils]: Spent 5.33s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-13 00:48:16,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:48:16,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968620840] [2024-10-13 00:48:16,441 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 00:48:16,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405380787] [2024-10-13 00:48:16,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405380787] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:48:16,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 00:48:16,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2024-10-13 00:48:16,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467514725] [2024-10-13 00:48:16,442 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 00:48:16,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 00:48:16,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:48:16,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 00:48:16,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2024-10-13 00:48:16,444 INFO L87 Difference]: Start difference. First operand 325 states and 446 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-13 00:48:17,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:48:17,058 INFO L93 Difference]: Finished difference Result 647 states and 860 transitions. [2024-10-13 00:48:17,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 00:48:17,059 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 137 [2024-10-13 00:48:17,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:48:17,065 INFO L225 Difference]: With dead ends: 647 [2024-10-13 00:48:17,065 INFO L226 Difference]: Without dead ends: 379 [2024-10-13 00:48:17,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2024-10-13 00:48:17,068 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 30 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:48:17,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 582 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 00:48:17,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-13 00:48:17,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 361. [2024-10-13 00:48:17,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 228 states have (on average 1.144736842105263) internal successors, (261), 230 states have internal predecessors, (261), 105 states have call successors, (105), 27 states have call predecessors, (105), 27 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-13 00:48:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 471 transitions. [2024-10-13 00:48:17,106 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 471 transitions. Word has length 137 [2024-10-13 00:48:17,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:48:17,106 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 471 transitions. [2024-10-13 00:48:17,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-13 00:48:17,107 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 471 transitions. [2024-10-13 00:48:17,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 00:48:17,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:48:17,108 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:48:17,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 00:48:17,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:48:17,309 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:48:17,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:48:17,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1130625202, now seen corresponding path program 1 times [2024-10-13 00:48:17,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:48:17,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085357383] [2024-10-13 00:48:17,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:48:17,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:48:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 00:48:17,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [14766242] [2024-10-13 00:48:17,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:48:17,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:48:17,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:48:17,392 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 00:48:17,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 00:48:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:48:17,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-13 00:48:17,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:48:18,800 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 260 proven. 210 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-13 00:48:18,800 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:48:52,555 WARN L286 SmtUtils]: Spent 6.17s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)