./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-86.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_25-while_file-86.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 2913b0b37cedaad46898416f14d6d48f794ee48dff0db1d9168d82fbaf447562 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:57:22,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:57:22,416 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:57:22,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:57:22,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:57:22,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:57:22,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:57:22,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:57:22,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:57:22,475 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:57:22,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:57:22,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:57:22,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:57:22,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:57:22,486 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:57:22,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:57:22,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:57:22,487 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:57:22,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:57:22,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:57:22,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:57:22,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:57:22,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:57:22,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:57:22,496 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:57:22,497 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:57:22,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:57:22,497 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:57:22,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:57:22,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:57:22,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:57:22,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:57:22,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:57:22,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:57:22,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:57:22,499 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:57:22,499 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:57:22,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:57:22,500 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:57:22,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:57:22,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:57:22,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:57:22,501 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 -> 2913b0b37cedaad46898416f14d6d48f794ee48dff0db1d9168d82fbaf447562 [2024-11-08 23:57:22,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:57:22,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:57:22,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:57:22,770 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:57:22,770 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:57:22,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-86.i [2024-11-08 23:57:24,232 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:57:24,447 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:57:24,448 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-86.i [2024-11-08 23:57:24,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8b307cc3/00383372ed314f85a9767ac852a518ba/FLAG20a5ac23c [2024-11-08 23:57:24,809 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8b307cc3/00383372ed314f85a9767ac852a518ba [2024-11-08 23:57:24,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:57:24,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:57:24,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:57:24,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:57:24,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:57:24,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:57:24" (1/1) ... [2024-11-08 23:57:24,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@789e1eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:24, skipping insertion in model container [2024-11-08 23:57:24,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:57:24" (1/1) ... [2024-11-08 23:57:24,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:57:25,026 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_25-while_file-86.i[915,928] [2024-11-08 23:57:25,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:57:25,079 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:57:25,091 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_25-while_file-86.i[915,928] [2024-11-08 23:57:25,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:57:25,127 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:57:25,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:25 WrapperNode [2024-11-08 23:57:25,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:57:25,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:57:25,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:57:25,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:57:25,135 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:57:25" (1/1) ... [2024-11-08 23:57:25,143 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:57:25" (1/1) ... [2024-11-08 23:57:25,178 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-11-08 23:57:25,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:57:25,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:57:25,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:57:25,180 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:57:25,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:25" (1/1) ... [2024-11-08 23:57:25,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:25" (1/1) ... [2024-11-08 23:57:25,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:25" (1/1) ... [2024-11-08 23:57:25,222 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:57:25,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:25" (1/1) ... [2024-11-08 23:57:25,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:25" (1/1) ... [2024-11-08 23:57:25,229 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:25" (1/1) ... [2024-11-08 23:57:25,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:25" (1/1) ... [2024-11-08 23:57:25,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:25" (1/1) ... [2024-11-08 23:57:25,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:25" (1/1) ... [2024-11-08 23:57:25,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:57:25,239 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:57:25,239 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:57:25,240 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:57:25,244 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:25" (1/1) ... [2024-11-08 23:57:25,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:57:25,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:57:25,286 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:57:25,291 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:57:25,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:57:25,344 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:57:25,345 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:57:25,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:57:25,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:57:25,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:57:25,407 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:57:25,409 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:57:25,710 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 23:57:25,711 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:57:25,730 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:57:25,731 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:57:25,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:57:25 BoogieIcfgContainer [2024-11-08 23:57:25,732 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:57:25,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:57:25,734 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:57:25,738 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:57:25,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:57:24" (1/3) ... [2024-11-08 23:57:25,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76de6555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:57:25, skipping insertion in model container [2024-11-08 23:57:25,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:25" (2/3) ... [2024-11-08 23:57:25,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76de6555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:57:25, skipping insertion in model container [2024-11-08 23:57:25,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:57:25" (3/3) ... [2024-11-08 23:57:25,743 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-86.i [2024-11-08 23:57:25,760 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:57:25,761 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:57:25,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:57:25,823 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;@30aab47a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:57:25,823 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:57:25,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 23:57:25,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 23:57:25,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:57:25,839 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:25,840 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:57:25,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:57:25,845 INFO L85 PathProgramCache]: Analyzing trace with hash 515927300, now seen corresponding path program 1 times [2024-11-08 23:57:25,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:57:25,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097716090] [2024-11-08 23:57:25,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:57:25,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:57:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:26,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:57:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:26,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:57:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:26,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:57:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:26,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:57:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:26,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:57:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:26,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:57:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:26,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:57:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:26,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:57:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:26,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:57:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:26,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:57:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:26,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:57:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:26,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:57:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:26,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:57:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:26,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:57:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:26,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:57:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:26,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:57:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:26,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:57:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:26,235 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 23:57:26,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:57:26,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097716090] [2024-11-08 23:57:26,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097716090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:57:26,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:57:26,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:57:26,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464623014] [2024-11-08 23:57:26,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:57:26,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:57:26,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:57:26,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:57:26,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:57:26,312 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 23:57:26,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:57:26,342 INFO L93 Difference]: Finished difference Result 95 states and 161 transitions. [2024-11-08 23:57:26,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:57:26,345 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2024-11-08 23:57:26,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:57:26,352 INFO L225 Difference]: With dead ends: 95 [2024-11-08 23:57:26,352 INFO L226 Difference]: Without dead ends: 47 [2024-11-08 23:57:26,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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:57:26,362 INFO L432 NwaCegarLoop]: 68 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, 68 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:57:26,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:57:26,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-08 23:57:26,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-08 23:57:26,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 23:57:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2024-11-08 23:57:26,415 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 108 [2024-11-08 23:57:26,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:57:26,417 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2024-11-08 23:57:26,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 23:57:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2024-11-08 23:57:26,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 23:57:26,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:57:26,423 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:26,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:57:26,423 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:57:26,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:57:26,425 INFO L85 PathProgramCache]: Analyzing trace with hash -148322110, now seen corresponding path program 1 times [2024-11-08 23:57:26,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:57:26,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143376112] [2024-11-08 23:57:26,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:57:26,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:57:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:30,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:57:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:30,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:57:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:30,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:57:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:30,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:57:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:30,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:57:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:30,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:57:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:30,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:57:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:30,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:57:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:30,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:57:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:30,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:57:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:30,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:57:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:30,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:57:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:30,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:57:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:30,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:57:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:30,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:57:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:30,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:57:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:30,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:57:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:30,860 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 23:57:30,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:57:30,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143376112] [2024-11-08 23:57:30,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143376112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:57:30,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:57:30,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 23:57:30,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114100044] [2024-11-08 23:57:30,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:57:30,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:57:30,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:57:30,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:57:30,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:57:30,869 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:57:31,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:57:31,378 INFO L93 Difference]: Finished difference Result 71 states and 98 transitions. [2024-11-08 23:57:31,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:57:31,379 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-11-08 23:57:31,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:57:31,381 INFO L225 Difference]: With dead ends: 71 [2024-11-08 23:57:31,382 INFO L226 Difference]: Without dead ends: 69 [2024-11-08 23:57:31,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:57:31,383 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 25 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:57:31,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 249 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:57:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-08 23:57:31,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2024-11-08 23:57:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 23:57:31,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2024-11-08 23:57:31,395 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 108 [2024-11-08 23:57:31,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:57:31,397 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2024-11-08 23:57:31,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:57:31,398 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2024-11-08 23:57:31,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 23:57:31,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:57:31,400 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:31,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:57:31,401 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:57:31,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:57:31,403 INFO L85 PathProgramCache]: Analyzing trace with hash -541349120, now seen corresponding path program 1 times [2024-11-08 23:57:31,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:57:31,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302032306] [2024-11-08 23:57:31,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:57:31,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:57:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:31,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:57:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:31,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:57:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:31,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:57:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:31,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:57:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:31,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:57:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:31,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:57:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:31,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:57:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:31,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:57:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:31,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:57:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:31,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:57:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:31,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:57:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:31,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:57:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:31,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:57:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:31,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:57:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:31,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:57:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:31,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:57:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:31,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:57:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:31,661 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 23:57:31,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:57:31,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302032306] [2024-11-08 23:57:31,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302032306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:57:31,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:57:31,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:57:31,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924326461] [2024-11-08 23:57:31,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:57:31,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:57:31,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:57:31,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:57:31,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:57:31,666 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:57:31,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:57:31,706 INFO L93 Difference]: Finished difference Result 151 states and 220 transitions. [2024-11-08 23:57:31,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:57:31,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-11-08 23:57:31,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:57:31,710 INFO L225 Difference]: With dead ends: 151 [2024-11-08 23:57:31,710 INFO L226 Difference]: Without dead ends: 99 [2024-11-08 23:57:31,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:57:31,718 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 32 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:57:31,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 136 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:57:31,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-08 23:57:31,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-11-08 23:57:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 60 states have internal predecessors, (73), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 23:57:31,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2024-11-08 23:57:31,752 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 108 [2024-11-08 23:57:31,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:57:31,752 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2024-11-08 23:57:31,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:57:31,753 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2024-11-08 23:57:31,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 23:57:31,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:57:31,754 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:31,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:57:31,755 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:57:31,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:57:31,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1978610814, now seen corresponding path program 1 times [2024-11-08 23:57:31,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:57:31,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895331052] [2024-11-08 23:57:31,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:57:31,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:57:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:32,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:57:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:32,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:57:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:32,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:57:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:32,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:57:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:32,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:57:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:32,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:57:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:32,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:57:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:32,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:57:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:32,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:57:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:32,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:57:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:32,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:57:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:32,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:57:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:32,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:57:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:32,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:57:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:32,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:57:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:32,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:57:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:32,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:57:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:32,960 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 23:57:32,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:57:32,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895331052] [2024-11-08 23:57:32,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895331052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:57:32,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:57:32,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 23:57:32,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057993373] [2024-11-08 23:57:32,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:57:32,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 23:57:32,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:57:32,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 23:57:32,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:57:32,964 INFO L87 Difference]: Start difference. First operand 97 states and 141 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:57:33,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:57:33,398 INFO L93 Difference]: Finished difference Result 118 states and 166 transitions. [2024-11-08 23:57:33,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 23:57:33,399 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-11-08 23:57:33,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:57:33,402 INFO L225 Difference]: With dead ends: 118 [2024-11-08 23:57:33,404 INFO L226 Difference]: Without dead ends: 116 [2024-11-08 23:57:33,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:57:33,406 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 19 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:57:33,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 420 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:57:33,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-08 23:57:33,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2024-11-08 23:57:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 62 states have internal predecessors, (76), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 23:57:33,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 144 transitions. [2024-11-08 23:57:33,435 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 144 transitions. Word has length 108 [2024-11-08 23:57:33,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:57:33,436 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 144 transitions. [2024-11-08 23:57:33,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:57:33,436 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 144 transitions. [2024-11-08 23:57:33,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 23:57:33,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:57:33,438 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:33,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:57:33,439 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:57:33,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:57:33,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1710987152, now seen corresponding path program 1 times [2024-11-08 23:57:33,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:57:33,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034787800] [2024-11-08 23:57:33,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:57:33,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:57:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:35,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:57:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:35,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:57:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:35,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:57:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:35,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:57:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:35,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:57:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:35,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:57:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:35,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:57:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:35,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:57:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:35,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:57:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:35,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:57:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:35,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:57:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:35,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:57:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:35,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:57:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:35,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:57:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:35,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:57:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:35,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:57:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:35,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:57:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 23:57:35,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:57:35,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034787800] [2024-11-08 23:57:35,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034787800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:57:35,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:57:35,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 23:57:35,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561797830] [2024-11-08 23:57:35,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:57:35,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:57:35,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:57:35,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:57:35,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:57:35,288 INFO L87 Difference]: Start difference. First operand 99 states and 144 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:57:36,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:57:36,044 INFO L93 Difference]: Finished difference Result 238 states and 341 transitions. [2024-11-08 23:57:36,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:57:36,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-08 23:57:36,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:57:36,047 INFO L225 Difference]: With dead ends: 238 [2024-11-08 23:57:36,047 INFO L226 Difference]: Without dead ends: 184 [2024-11-08 23:57:36,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:57:36,049 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 101 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 23:57:36,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 277 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 23:57:36,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-08 23:57:36,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 177. [2024-11-08 23:57:36,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 106 states have (on average 1.179245283018868) internal successors, (125), 109 states have internal predecessors, (125), 65 states have call successors, (65), 5 states have call predecessors, (65), 5 states have return successors, (65), 62 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-08 23:57:36,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 255 transitions. [2024-11-08 23:57:36,093 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 255 transitions. Word has length 109 [2024-11-08 23:57:36,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:57:36,096 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 255 transitions. [2024-11-08 23:57:36,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:57:36,097 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 255 transitions. [2024-11-08 23:57:36,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 23:57:36,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:57:36,098 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:36,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:57:36,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:57:36,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:57:36,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1712834194, now seen corresponding path program 1 times [2024-11-08 23:57:36,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:57:36,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621927048] [2024-11-08 23:57:36,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:57:36,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:57:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:38,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:57:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:38,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:57:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:38,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:57:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:38,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:57:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:38,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:57:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:38,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:57:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:38,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:57:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:38,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:57:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:38,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:57:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:38,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:57:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:38,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:57:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:38,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:57:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:38,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:57:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:38,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:57:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:38,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:57:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:38,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:57:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:38,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:57:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:38,406 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 23:57:38,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:57:38,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621927048] [2024-11-08 23:57:38,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621927048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:57:38,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:57:38,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 23:57:38,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803591513] [2024-11-08 23:57:38,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:57:38,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:57:38,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:57:38,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:57:38,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:57:38,408 INFO L87 Difference]: Start difference. First operand 177 states and 255 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:57:38,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:57:38,976 INFO L93 Difference]: Finished difference Result 292 states and 418 transitions. [2024-11-08 23:57:38,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:57:38,977 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-08 23:57:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:57:38,982 INFO L225 Difference]: With dead ends: 292 [2024-11-08 23:57:38,984 INFO L226 Difference]: Without dead ends: 181 [2024-11-08 23:57:38,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:57:38,986 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 28 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:57:38,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 334 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:57:38,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-08 23:57:39,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2024-11-08 23:57:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 109 states have internal predecessors, (123), 65 states have call successors, (65), 5 states have call predecessors, (65), 5 states have return successors, (65), 62 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-08 23:57:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 253 transitions. [2024-11-08 23:57:39,033 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 253 transitions. Word has length 109 [2024-11-08 23:57:39,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:57:39,034 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 253 transitions. [2024-11-08 23:57:39,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:57:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 253 transitions. [2024-11-08 23:57:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 23:57:39,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:57:39,036 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:39,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 23:57:39,036 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:57:39,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:57:39,037 INFO L85 PathProgramCache]: Analyzing trace with hash 901640526, now seen corresponding path program 1 times [2024-11-08 23:57:39,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:57:39,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904187818] [2024-11-08 23:57:39,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:57:39,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:57:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:57:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:57:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:57:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:57:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:57:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:57:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:57:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:57:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:57:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:57:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:57:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:57:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:57:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:57:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:57:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:57:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:57:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,124 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 23:57:39,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:57:39,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904187818] [2024-11-08 23:57:39,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904187818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:57:39,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:57:39,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:57:39,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597722786] [2024-11-08 23:57:39,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:57:39,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:57:39,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:57:39,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:57:39,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:57:39,127 INFO L87 Difference]: Start difference. First operand 177 states and 253 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:57:39,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:57:39,167 INFO L93 Difference]: Finished difference Result 354 states and 507 transitions. [2024-11-08 23:57:39,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:57:39,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-08 23:57:39,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:57:39,173 INFO L225 Difference]: With dead ends: 354 [2024-11-08 23:57:39,173 INFO L226 Difference]: Without dead ends: 243 [2024-11-08 23:57:39,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:57:39,174 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 62 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:57:39,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 136 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:57:39,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-08 23:57:39,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 178. [2024-11-08 23:57:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 107 states have (on average 1.1495327102803738) internal successors, (123), 110 states have internal predecessors, (123), 65 states have call successors, (65), 5 states have call predecessors, (65), 5 states have return successors, (65), 62 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-08 23:57:39,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 253 transitions. [2024-11-08 23:57:39,207 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 253 transitions. Word has length 109 [2024-11-08 23:57:39,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:57:39,208 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 253 transitions. [2024-11-08 23:57:39,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:57:39,208 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 253 transitions. [2024-11-08 23:57:39,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 23:57:39,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:57:39,210 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:39,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 23:57:39,210 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:57:39,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:57:39,211 INFO L85 PathProgramCache]: Analyzing trace with hash -873366836, now seen corresponding path program 1 times [2024-11-08 23:57:39,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:57:39,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727766320] [2024-11-08 23:57:39,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:57:39,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:57:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:57:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:57:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:57:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:57:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:57:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:57:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:57:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:57:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:57:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:57:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:57:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:57:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:57:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:57:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:57:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:57:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:57:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 23:57:39,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:57:39,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727766320] [2024-11-08 23:57:39,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727766320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:57:39,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:57:39,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:57:39,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101677368] [2024-11-08 23:57:39,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:57:39,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:57:39,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:57:39,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:57:39,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:57:39,801 INFO L87 Difference]: Start difference. First operand 178 states and 253 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 23:57:39,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:57:39,985 INFO L93 Difference]: Finished difference Result 610 states and 868 transitions. [2024-11-08 23:57:39,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:57:39,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 109 [2024-11-08 23:57:39,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:57:39,989 INFO L225 Difference]: With dead ends: 610 [2024-11-08 23:57:39,989 INFO L226 Difference]: Without dead ends: 435 [2024-11-08 23:57:39,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:57:39,991 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 95 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:57:39,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 158 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:57:39,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-08 23:57:40,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 329. [2024-11-08 23:57:40,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 198 states have (on average 1.1414141414141414) internal successors, (226), 203 states have internal predecessors, (226), 121 states have call successors, (121), 9 states have call predecessors, (121), 9 states have return successors, (121), 116 states have call predecessors, (121), 121 states have call successors, (121) [2024-11-08 23:57:40,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 468 transitions. [2024-11-08 23:57:40,050 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 468 transitions. Word has length 109 [2024-11-08 23:57:40,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:57:40,051 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 468 transitions. [2024-11-08 23:57:40,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 23:57:40,051 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 468 transitions. [2024-11-08 23:57:40,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 23:57:40,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:57:40,052 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:40,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 23:57:40,053 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:57:40,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:57:40,053 INFO L85 PathProgramCache]: Analyzing trace with hash -871519794, now seen corresponding path program 1 times [2024-11-08 23:57:40,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:57:40,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197947464] [2024-11-08 23:57:40,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:57:40,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:57:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:40,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:57:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:40,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:57:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:40,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:57:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:40,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:57:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:40,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:57:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:40,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:57:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:40,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:57:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:40,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:57:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:40,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:57:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:40,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:57:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:40,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:57:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:40,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:57:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:40,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:57:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:40,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:57:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:40,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:57:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:40,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:57:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:40,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:57:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:40,607 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 23:57:40,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:57:40,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197947464] [2024-11-08 23:57:40,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197947464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:57:40,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:57:40,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 23:57:40,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293518882] [2024-11-08 23:57:40,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:57:40,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 23:57:40,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:57:40,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 23:57:40,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:57:40,609 INFO L87 Difference]: Start difference. First operand 329 states and 468 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:57:40,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:57:40,962 INFO L93 Difference]: Finished difference Result 454 states and 637 transitions. [2024-11-08 23:57:40,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 23:57:40,963 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-08 23:57:40,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:57:40,967 INFO L225 Difference]: With dead ends: 454 [2024-11-08 23:57:40,967 INFO L226 Difference]: Without dead ends: 452 [2024-11-08 23:57:40,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:57:40,970 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 147 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:57:40,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 425 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:57:40,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-08 23:57:41,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 406. [2024-11-08 23:57:41,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 231 states have (on average 1.1082251082251082) internal successors, (256), 238 states have internal predecessors, (256), 159 states have call successors, (159), 15 states have call predecessors, (159), 15 states have return successors, (159), 152 states have call predecessors, (159), 159 states have call successors, (159) [2024-11-08 23:57:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 574 transitions. [2024-11-08 23:57:41,045 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 574 transitions. Word has length 109 [2024-11-08 23:57:41,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:57:41,046 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 574 transitions. [2024-11-08 23:57:41,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:57:41,046 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 574 transitions. [2024-11-08 23:57:41,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 23:57:41,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:57:41,050 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:57:41,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 23:57:41,050 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:57:41,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:57:41,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1897628350, now seen corresponding path program 1 times [2024-11-08 23:57:41,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:57:41,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062057455] [2024-11-08 23:57:41,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:57:41,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:57:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:57:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:57:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:57:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:57:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:57:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:57:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:57:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:57:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:57:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:57:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:57:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:57:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:57:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:57:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:57:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:57:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:57:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:57:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:57:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:57:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:57:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:57:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:57:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 23:57:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 23:57:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 23:57:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 23:57:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 23:57:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 23:57:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 23:57:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-08 23:57:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-08 23:57:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-08 23:57:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-08 23:57:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2271 trivial. 0 not checked. [2024-11-08 23:57:43,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:57:43,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062057455] [2024-11-08 23:57:43,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062057455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:57:43,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:57:43,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 23:57:43,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418925243] [2024-11-08 23:57:43,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:57:43,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:57:43,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:57:43,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:57:43,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:57:43,381 INFO L87 Difference]: Start difference. First operand 406 states and 574 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:57:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:57:43,802 INFO L93 Difference]: Finished difference Result 407 states and 575 transitions. [2024-11-08 23:57:43,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:57:43,803 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 213 [2024-11-08 23:57:43,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:57:43,804 INFO L225 Difference]: With dead ends: 407 [2024-11-08 23:57:43,804 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 23:57:43,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:57:43,806 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 31 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:57:43,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 235 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:57:43,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 23:57:43,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 23:57:43,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 23:57:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 23:57:43,808 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 213 [2024-11-08 23:57:43,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:57:43,808 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 23:57:43,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:57:43,808 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 23:57:43,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 23:57:43,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:57:43,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 23:57:43,815 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:57:43,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 23:57:45,037 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:57:45,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:57:45 BoogieIcfgContainer [2024-11-08 23:57:45,063 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:57:45,064 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:57:45,064 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:57:45,064 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:57:45,065 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:57:25" (3/4) ... [2024-11-08 23:57:45,067 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 23:57:45,071 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-08 23:57:45,075 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-08 23:57:45,076 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 23:57:45,076 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 23:57:45,076 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 23:57:45,184 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 23:57:45,185 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 23:57:45,185 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:57:45,185 INFO L158 Benchmark]: Toolchain (without parser) took 20372.88ms. Allocated memory was 130.0MB in the beginning and 423.6MB in the end (delta: 293.6MB). Free memory was 60.2MB in the beginning and 261.9MB in the end (delta: -201.7MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB. [2024-11-08 23:57:45,186 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:57:45,186 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.16ms. Allocated memory was 130.0MB in the beginning and 167.8MB in the end (delta: 37.7MB). Free memory was 59.8MB in the beginning and 132.2MB in the end (delta: -72.3MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-11-08 23:57:45,186 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.88ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 128.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:57:45,187 INFO L158 Benchmark]: Boogie Preprocessor took 59.21ms. Allocated memory is still 167.8MB. Free memory was 128.8MB in the beginning and 123.3MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:57:45,187 INFO L158 Benchmark]: RCFGBuilder took 492.85ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 104.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 23:57:45,187 INFO L158 Benchmark]: TraceAbstraction took 19329.41ms. Allocated memory was 167.8MB in the beginning and 423.6MB in the end (delta: 255.9MB). Free memory was 103.6MB in the beginning and 268.2MB in the end (delta: -164.6MB). Peak memory consumption was 223.4MB. Max. memory is 16.1GB. [2024-11-08 23:57:45,188 INFO L158 Benchmark]: Witness Printer took 120.91ms. Allocated memory is still 423.6MB. Free memory was 268.2MB in the beginning and 261.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:57:45,189 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.16ms. Allocated memory was 130.0MB in the beginning and 167.8MB in the end (delta: 37.7MB). Free memory was 59.8MB in the beginning and 132.2MB in the end (delta: -72.3MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.88ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 128.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.21ms. Allocated memory is still 167.8MB. Free memory was 128.8MB in the beginning and 123.3MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 492.85ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 104.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 19329.41ms. Allocated memory was 167.8MB in the beginning and 423.6MB in the end (delta: 255.9MB). Free memory was 103.6MB in the beginning and 268.2MB in the end (delta: -164.6MB). Peak memory consumption was 223.4MB. Max. memory is 16.1GB. * Witness Printer took 120.91ms. Allocated memory is still 423.6MB. Free memory was 268.2MB in the beginning and 261.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.0s, OverallIterations: 10, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 540 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 540 mSDsluCounter, 2438 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1704 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1007 IncrementalHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 734 mSDtfsCounter, 1007 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 480 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=406occurred in iteration=9, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 261 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 1190 NumberOfCodeBlocks, 1190 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1180 ConstructedInterpolants, 0 QuantifiedInterpolants, 4783 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 7176/7176 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((var_1_18 <= 0) && (var_1_7 == 4)) && (var_1_16 == 0)) && (((4294967295 + var_1_13) % 4294967296) <= 4294967294)) && (0 <= 0)) || ((((((0 < var_1_7) || (var_1_12 == 0)) || (0 < (((var_1_7 * 4294967295) + var_1_13) % 4294967296))) && (var_1_7 == var_1_1)) && ((((((var_1_7 == var_1_11) || (var_1_9 < ((((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10) + 1))) || (var_1_16 == 0)) && (((((0 < (var_1_3 + 1)) || (var_1_7 == var_1_11)) || (var_1_16 == 0)) || (0 < ((long long) var_1_8 + 1))) || (((var_1_3 >= 0) ? (var_1_3 % var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 % var_1_8) + var_1_8) : ((var_1_3 % var_1_8) - var_1_8))) == 0))) && ((((var_1_7 == var_1_11) || (var_1_16 == 0)) || (((long long) var_1_9 + 1) == (((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10))) || (((var_1_3 + 1) <= 0) && (((var_1_3 >= 0) ? (var_1_3 % var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 % var_1_8) + var_1_8) : ((var_1_3 % var_1_8) - var_1_8))) != 0)))) || (((long long) var_1_9 + 1) < (((var_1_3 >= 0) ? (var_1_3 / var_1_8) : ((var_1_8 >= 0) ? ((var_1_3 / var_1_8) - 1) : ((var_1_3 / var_1_8) + 1))) + var_1_10)))) && ((var_1_18 == var_1_16) || (var_1_13 < (((((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) >= 0) ? (((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) % 4294967296) : ((((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) % 4294967296) + 4294967296)) + 1))))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (last_1_var_1_1 == \old(last_1_var_1_1))) RESULT: Ultimate proved your program to be correct! [2024-11-08 23:57:45,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE