./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-30.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-30.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 5536eec27f0e30a34c1a96e838ac5cf11c75a521ed3ec15ff2fb1a338cbfa9d3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:29:43,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:29:43,423 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:29:43,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:29:43,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:29:43,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:29:43,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:29:43,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:29:43,478 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:29:43,479 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:29:43,481 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:29:43,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:29:43,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:29:43,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:29:43,485 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:29:43,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:29:43,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:29:43,486 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:29:43,487 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:29:43,487 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:29:43,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:29:43,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:29:43,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:29:43,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:29:43,489 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:29:43,489 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:29:43,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:29:43,490 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:29:43,490 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:29:43,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:29:43,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:29:43,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:29:43,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:29:43,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:29:43,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:29:43,493 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:29:43,493 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:29:43,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:29:43,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:29:43,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:29:43,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:29:43,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:29:43,494 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 -> 5536eec27f0e30a34c1a96e838ac5cf11c75a521ed3ec15ff2fb1a338cbfa9d3 [2024-11-08 23:29:43,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:29:43,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:29:43,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:29:43,790 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:29:43,790 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:29:43,792 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-30.i [2024-11-08 23:29:45,218 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:29:45,444 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:29:45,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-30.i [2024-11-08 23:29:45,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3874e5d65/5e5f3dd60b8044329650b4667a4e85af/FLAGdc5753236 [2024-11-08 23:29:45,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3874e5d65/5e5f3dd60b8044329650b4667a4e85af [2024-11-08 23:29:45,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:29:45,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:29:45,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:29:45,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:29:45,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:29:45,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:29:45" (1/1) ... [2024-11-08 23:29:45,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f5b41d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:45, skipping insertion in model container [2024-11-08 23:29:45,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:29:45" (1/1) ... [2024-11-08 23:29:45,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:29:46,027 WARN L250 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_loopvsstraightlinecode_100-while_file-30.i[916,929] [2024-11-08 23:29:46,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:29:46,133 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:29:46,156 WARN L250 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_loopvsstraightlinecode_100-while_file-30.i[916,929] [2024-11-08 23:29:46,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:29:46,289 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:29:46,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:46 WrapperNode [2024-11-08 23:29:46,291 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:29:46,292 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:29:46,292 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:29:46,293 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:29:46,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:46" (1/1) ... [2024-11-08 23:29:46,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:46" (1/1) ... [2024-11-08 23:29:46,363 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247 [2024-11-08 23:29:46,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:29:46,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:29:46,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:29:46,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:29:46,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:46" (1/1) ... [2024-11-08 23:29:46,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:46" (1/1) ... [2024-11-08 23:29:46,382 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:46" (1/1) ... [2024-11-08 23:29:46,408 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-11-08 23:29:46,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:46" (1/1) ... [2024-11-08 23:29:46,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:46" (1/1) ... [2024-11-08 23:29:46,433 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:46" (1/1) ... [2024-11-08 23:29:46,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:46" (1/1) ... [2024-11-08 23:29:46,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:46" (1/1) ... [2024-11-08 23:29:46,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:46" (1/1) ... [2024-11-08 23:29:46,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:29:46,463 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:29:46,463 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:29:46,464 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:29:46,464 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:46" (1/1) ... [2024-11-08 23:29:46,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:29:46,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:29:46,500 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-11-08 23:29:46,508 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-11-08 23:29:46,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:29:46,554 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:29:46,555 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:29:46,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:29:46,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:29:46,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:29:46,668 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:29:46,670 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:29:47,238 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-08 23:29:47,238 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:29:47,256 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:29:47,257 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:29:47,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:29:47 BoogieIcfgContainer [2024-11-08 23:29:47,258 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:29:47,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:29:47,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:29:47,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:29:47,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:29:45" (1/3) ... [2024-11-08 23:29:47,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81cdb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:29:47, skipping insertion in model container [2024-11-08 23:29:47,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:46" (2/3) ... [2024-11-08 23:29:47,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81cdb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:29:47, skipping insertion in model container [2024-11-08 23:29:47,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:29:47" (3/3) ... [2024-11-08 23:29:47,267 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-30.i [2024-11-08 23:29:47,282 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:29:47,282 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:29:47,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:29:47,357 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;@2cf851ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:29:47,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:29:47,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:29:47,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 23:29:47,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:29:47,385 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:29:47,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:29:47,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:29:47,393 INFO L85 PathProgramCache]: Analyzing trace with hash 435639877, now seen corresponding path program 1 times [2024-11-08 23:29:47,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:29:47,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815595561] [2024-11-08 23:29:47,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:29:47,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:29:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:29:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:29:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:29:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:29:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:29:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:29:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:29:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:29:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:29:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:29:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:29:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:29:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:29:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:29:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:29:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:29:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:29:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:29:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:29:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:29:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 23:29:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:29:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 23:29:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 23:29:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:47,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:29:47,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:29:47,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815595561] [2024-11-08 23:29:47,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815595561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:29:47,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:29:47,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:29:47,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490157558] [2024-11-08 23:29:47,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:29:47,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:29:47,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:29:47,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:29:47,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:29:47,964 INFO L87 Difference]: Start difference. First operand has 102 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 23:29:47,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:29:47,991 INFO L93 Difference]: Finished difference Result 192 states and 326 transitions. [2024-11-08 23:29:47,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:29:47,994 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 165 [2024-11-08 23:29:47,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:29:48,003 INFO L225 Difference]: With dead ends: 192 [2024-11-08 23:29:48,003 INFO L226 Difference]: Without dead ends: 93 [2024-11-08 23:29:48,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-11-08 23:29:48,009 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:29:48,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:29:48,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-08 23:29:48,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-08 23:29:48,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 67 states have internal predecessors, (93), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:29:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 141 transitions. [2024-11-08 23:29:48,060 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 141 transitions. Word has length 165 [2024-11-08 23:29:48,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:29:48,060 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 141 transitions. [2024-11-08 23:29:48,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 23:29:48,060 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 141 transitions. [2024-11-08 23:29:48,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 23:29:48,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:29:48,068 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:29:48,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:29:48,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:29:48,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:29:48,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1395853833, now seen corresponding path program 1 times [2024-11-08 23:29:48,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:29:48,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380892040] [2024-11-08 23:29:48,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:29:48,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:29:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:48,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:29:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:48,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:29:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:48,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:29:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:48,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:29:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:48,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:29:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:48,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:29:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:48,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:29:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:48,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:29:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:48,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:29:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:49,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:29:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:49,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:29:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:49,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:29:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:49,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:29:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:49,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:29:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:49,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:29:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:49,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:29:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:49,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:29:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:49,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:29:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:49,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:29:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:49,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:29:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:49,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 23:29:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:49,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:29:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:49,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 23:29:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:49,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 23:29:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:29:49,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:29:49,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380892040] [2024-11-08 23:29:49,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380892040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:29:49,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:29:49,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:29:49,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324470034] [2024-11-08 23:29:49,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:29:49,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:29:49,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:29:49,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:29:49,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:29:49,124 INFO L87 Difference]: Start difference. First operand 93 states and 141 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:29:49,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:29:49,390 INFO L93 Difference]: Finished difference Result 333 states and 501 transitions. [2024-11-08 23:29:49,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:29:49,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2024-11-08 23:29:49,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:29:49,399 INFO L225 Difference]: With dead ends: 333 [2024-11-08 23:29:49,399 INFO L226 Difference]: Without dead ends: 243 [2024-11-08 23:29:49,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 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-11-08 23:29:49,403 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 199 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:29:49,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 471 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:29:49,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-08 23:29:49,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 175. [2024-11-08 23:29:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 124 states have (on average 1.3548387096774193) internal successors, (168), 124 states have internal predecessors, (168), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 23:29:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 264 transitions. [2024-11-08 23:29:49,445 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 264 transitions. Word has length 165 [2024-11-08 23:29:49,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:29:49,445 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 264 transitions. [2024-11-08 23:29:49,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:29:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 264 transitions. [2024-11-08 23:29:49,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 23:29:49,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:29:49,449 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:29:49,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:29:49,449 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:29:49,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:29:49,450 INFO L85 PathProgramCache]: Analyzing trace with hash -341933495, now seen corresponding path program 1 times [2024-11-08 23:29:49,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:29:49,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920293041] [2024-11-08 23:29:49,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:29:49,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:29:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:29:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:29:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:29:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:29:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:29:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:29:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:29:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:29:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:29:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:29:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:29:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:29:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:29:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:29:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:29:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:29:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:29:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:29:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:29:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:29:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 23:29:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:29:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 23:29:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 23:29:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 23:29:50,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:29:50,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920293041] [2024-11-08 23:29:50,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920293041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:29:50,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953570369] [2024-11-08 23:29:50,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:29:50,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:29:50,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:29:50,767 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-11-08 23:29:50,771 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-11-08 23:29:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:50,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 23:29:50,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:29:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 534 proven. 33 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2024-11-08 23:29:51,378 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:29:51,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 99 proven. 36 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-08 23:29:51,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953570369] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:29:51,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:29:51,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2024-11-08 23:29:51,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298487666] [2024-11-08 23:29:51,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:29:51,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 23:29:51,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:29:51,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 23:29:51,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-11-08 23:29:51,813 INFO L87 Difference]: Start difference. First operand 175 states and 264 transitions. Second operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2024-11-08 23:29:52,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:29:52,305 INFO L93 Difference]: Finished difference Result 279 states and 411 transitions. [2024-11-08 23:29:52,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 23:29:52,306 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) Word has length 166 [2024-11-08 23:29:52,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:29:52,308 INFO L225 Difference]: With dead ends: 279 [2024-11-08 23:29:52,309 INFO L226 Difference]: Without dead ends: 107 [2024-11-08 23:29:52,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 372 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=249, Invalid=563, Unknown=0, NotChecked=0, Total=812 [2024-11-08 23:29:52,312 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 430 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:29:52,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 261 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:29:52,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-08 23:29:52,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2024-11-08 23:29:52,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 73 states have internal predecessors, (94), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:29:52,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 142 transitions. [2024-11-08 23:29:52,329 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 142 transitions. Word has length 166 [2024-11-08 23:29:52,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:29:52,330 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 142 transitions. [2024-11-08 23:29:52,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2024-11-08 23:29:52,330 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 142 transitions. [2024-11-08 23:29:52,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 23:29:52,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:29:52,333 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:29:52,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 23:29:52,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:29:52,538 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:29:52,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:29:52,539 INFO L85 PathProgramCache]: Analyzing trace with hash -244228299, now seen corresponding path program 1 times [2024-11-08 23:29:52,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:29:52,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199215267] [2024-11-08 23:29:52,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:29:52,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:29:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:29:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:29:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:29:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:29:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:29:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:29:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:29:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:29:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:29:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:29:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:29:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:29:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:29:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:29:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:29:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:29:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:29:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:29:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:29:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:29:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 23:29:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:29:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 23:29:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 23:29:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 93 proven. 39 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-11-08 23:29:59,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:29:59,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199215267] [2024-11-08 23:29:59,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199215267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:29:59,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523435500] [2024-11-08 23:29:59,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:29:59,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:29:59,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:29:59,402 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-11-08 23:29:59,405 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-11-08 23:29:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:59,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-08 23:29:59,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:30:02,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 692 proven. 90 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2024-11-08 23:30:02,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:30:13,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 183 proven. 75 refuted. 0 times theorem prover too weak. 846 trivial. 0 not checked. [2024-11-08 23:30:13,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523435500] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:30:13,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:30:13,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 24, 21] total 57 [2024-11-08 23:30:13,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286178077] [2024-11-08 23:30:13,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:30:13,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-08 23:30:13,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:30:13,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-08 23:30:13,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=2694, Unknown=0, NotChecked=0, Total=3192 [2024-11-08 23:30:13,043 INFO L87 Difference]: Start difference. First operand 101 states and 142 transitions. Second operand has 57 states, 55 states have (on average 2.890909090909091) internal successors, (159), 53 states have internal predecessors, (159), 13 states have call successors, (72), 6 states have call predecessors, (72), 13 states have return successors, (72), 15 states have call predecessors, (72), 13 states have call successors, (72)