./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-1.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 21a1125ae0cc2adce78274abe3bb5e8e98d6a4c7db57dc682e7d7594a508e739 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:59:05,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:59:05,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 05:59:05,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:59:05,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:59:05,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:59:05,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:59:05,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:59:05,266 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:59:05,266 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:59:05,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:59:05,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:59:05,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:59:05,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:59:05,268 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:59:05,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:59:05,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:59:05,269 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:59:05,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 05:59:05,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:59:05,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:59:05,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:59:05,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:59:05,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:59:05,276 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:59:05,276 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:59:05,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:59:05,278 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:59:05,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:59:05,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:59:05,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:59:05,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:59:05,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:59:05,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:59:05,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:59:05,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:59:05,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 05:59:05,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 05:59:05,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:59:05,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:59:05,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:59:05,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:59:05,285 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 -> 21a1125ae0cc2adce78274abe3bb5e8e98d6a4c7db57dc682e7d7594a508e739 [2024-11-20 05:59:05,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:59:05,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:59:05,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:59:05,562 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:59:05,562 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:59:05,563 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-1.i [2024-11-20 05:59:06,998 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:59:07,207 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:59:07,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-1.i [2024-11-20 05:59:07,218 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5abfeb16f/e0f5d5647c0943db9428ff3b871873d2/FLAG92df8f70f [2024-11-20 05:59:07,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5abfeb16f/e0f5d5647c0943db9428ff3b871873d2 [2024-11-20 05:59:07,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:59:07,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:59:07,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:59:07,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:59:07,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:59:07,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:59:07" (1/1) ... [2024-11-20 05:59:07,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ea8bf75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:07, skipping insertion in model container [2024-11-20 05:59:07,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:59:07" (1/1) ... [2024-11-20 05:59:07,623 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:59:07,794 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_floatingpointinfluence_no-floats_file-1.i[915,928] [2024-11-20 05:59:07,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:59:07,840 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:59:07,851 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_floatingpointinfluence_no-floats_file-1.i[915,928] [2024-11-20 05:59:07,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:59:07,885 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:59:07,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:07 WrapperNode [2024-11-20 05:59:07,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:59:07,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:59:07,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:59:07,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:59:07,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:07" (1/1) ... [2024-11-20 05:59:07,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:07" (1/1) ... [2024-11-20 05:59:07,951 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-11-20 05:59:07,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:59:07,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:59:07,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:59:07,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:59:07,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:07" (1/1) ... [2024-11-20 05:59:07,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:07" (1/1) ... [2024-11-20 05:59:07,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:07" (1/1) ... [2024-11-20 05:59:07,988 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-20 05:59:07,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:07" (1/1) ... [2024-11-20 05:59:07,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:07" (1/1) ... [2024-11-20 05:59:08,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:07" (1/1) ... [2024-11-20 05:59:08,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:07" (1/1) ... [2024-11-20 05:59:08,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:07" (1/1) ... [2024-11-20 05:59:08,011 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:07" (1/1) ... [2024-11-20 05:59:08,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:59:08,016 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:59:08,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:59:08,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:59:08,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:07" (1/1) ... [2024-11-20 05:59:08,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:59:08,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:59:08,065 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-20 05:59:08,069 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-20 05:59:08,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:59:08,118 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:59:08,119 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:59:08,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 05:59:08,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:59:08,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:59:08,204 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:59:08,207 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:59:08,485 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-20 05:59:08,485 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:59:08,501 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:59:08,503 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:59:08,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:59:08 BoogieIcfgContainer [2024-11-20 05:59:08,503 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:59:08,506 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:59:08,506 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:59:08,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:59:08,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:59:07" (1/3) ... [2024-11-20 05:59:08,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755880d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:59:08, skipping insertion in model container [2024-11-20 05:59:08,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:07" (2/3) ... [2024-11-20 05:59:08,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755880d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:59:08, skipping insertion in model container [2024-11-20 05:59:08,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:59:08" (3/3) ... [2024-11-20 05:59:08,515 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-1.i [2024-11-20 05:59:08,531 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:59:08,532 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:59:08,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:59:08,617 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;@3eab4035, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:59:08,617 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:59:08,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 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-20 05:59:08,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-20 05:59:08,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:59:08,634 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, 1, 1, 1] [2024-11-20 05:59:08,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:59:08,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:59:08,639 INFO L85 PathProgramCache]: Analyzing trace with hash 119796604, now seen corresponding path program 1 times [2024-11-20 05:59:08,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:59:08,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034308519] [2024-11-20 05:59:08,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:59:08,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:59:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:08,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:59:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:08,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:59:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:08,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:59:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:08,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:59:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:08,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:59:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:08,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:59:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:08,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:59:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:08,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:59:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:08,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:59:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:08,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:59:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:08,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:59:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:09,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:59:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:09,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:59:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:09,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:59:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:09,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:59:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:09,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:59:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:09,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 05:59:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:09,049 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-20 05:59:09,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:59:09,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034308519] [2024-11-20 05:59:09,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034308519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:59:09,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:59:09,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:59:09,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908067372] [2024-11-20 05:59:09,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:59:09,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:59:09,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:59:09,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:59:09,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:59:09,097 INFO L87 Difference]: Start difference. First operand has 61 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-20 05:59:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:59:09,129 INFO L93 Difference]: Finished difference Result 115 states and 189 transitions. [2024-11-20 05:59:09,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:59:09,132 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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 112 [2024-11-20 05:59:09,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:59:09,139 INFO L225 Difference]: With dead ends: 115 [2024-11-20 05:59:09,140 INFO L226 Difference]: Without dead ends: 57 [2024-11-20 05:59:09,145 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-20 05:59:09,150 INFO L432 NwaCegarLoop]: 82 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, 82 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-20 05:59:09,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:59:09,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-20 05:59:09,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-20 05:59:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 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-20 05:59:09,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 82 transitions. [2024-11-20 05:59:09,227 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 82 transitions. Word has length 112 [2024-11-20 05:59:09,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:59:09,228 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 82 transitions. [2024-11-20 05:59:09,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-20 05:59:09,229 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2024-11-20 05:59:09,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-20 05:59:09,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:59:09,234 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, 1, 1, 1] [2024-11-20 05:59:09,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 05:59:09,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:59:09,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:59:09,235 INFO L85 PathProgramCache]: Analyzing trace with hash -918120518, now seen corresponding path program 1 times [2024-11-20 05:59:09,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:59:09,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470000363] [2024-11-20 05:59:09,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:59:09,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:59:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:10,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:59:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:10,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:59:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:10,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:59:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:10,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:59:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:10,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:59:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:10,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:59:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:10,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:59:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:10,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:59:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:10,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:59:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:10,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:59:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:10,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:59:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:10,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:59:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:10,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:59:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:10,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:59:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:10,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:59:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:10,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:59:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:10,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 05:59:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:10,466 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-20 05:59:10,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:59:10,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470000363] [2024-11-20 05:59:10,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470000363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:59:10,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:59:10,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 05:59:10,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364012446] [2024-11-20 05:59:10,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:59:10,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 05:59:10,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:59:10,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 05:59:10,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 05:59:10,476 INFO L87 Difference]: Start difference. First operand 57 states and 82 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-20 05:59:10,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:59:10,716 INFO L93 Difference]: Finished difference Result 155 states and 218 transitions. [2024-11-20 05:59:10,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 05:59:10,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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 112 [2024-11-20 05:59:10,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:59:10,722 INFO L225 Difference]: With dead ends: 155 [2024-11-20 05:59:10,722 INFO L226 Difference]: Without dead ends: 101 [2024-11-20 05:59:10,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-20 05:59:10,726 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 47 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:59:10,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 283 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:59:10,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-20 05:59:10,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 69. [2024-11-20 05:59:10,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 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-20 05:59:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 99 transitions. [2024-11-20 05:59:10,747 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 99 transitions. Word has length 112 [2024-11-20 05:59:10,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:59:10,748 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 99 transitions. [2024-11-20 05:59:10,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-20 05:59:10,749 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 99 transitions. [2024-11-20 05:59:10,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-20 05:59:10,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:59:10,751 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, 1, 1, 1] [2024-11-20 05:59:10,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 05:59:10,751 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:59:10,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:59:10,752 INFO L85 PathProgramCache]: Analyzing trace with hash -659955080, now seen corresponding path program 1 times [2024-11-20 05:59:10,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:59:10,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488678222] [2024-11-20 05:59:10,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:59:10,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:59:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:59:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:59:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:59:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:59:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:59:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:59:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:59:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:59:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:59:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:59:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:59:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:59:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:59:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:59:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:59:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:59:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 05:59:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,379 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-20 05:59:11,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:59:11,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488678222] [2024-11-20 05:59:11,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488678222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:59:11,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:59:11,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 05:59:11,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559097250] [2024-11-20 05:59:11,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:59:11,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 05:59:11,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:59:11,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 05:59:11,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 05:59:11,383 INFO L87 Difference]: Start difference. First operand 69 states and 99 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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-20 05:59:11,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:59:11,579 INFO L93 Difference]: Finished difference Result 167 states and 234 transitions. [2024-11-20 05:59:11,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 05:59:11,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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 112 [2024-11-20 05:59:11,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:59:11,582 INFO L225 Difference]: With dead ends: 167 [2024-11-20 05:59:11,582 INFO L226 Difference]: Without dead ends: 101 [2024-11-20 05:59:11,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-20 05:59:11,584 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 46 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:59:11,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 439 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:59:11,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-20 05:59:11,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 69. [2024-11-20 05:59:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 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-20 05:59:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 99 transitions. [2024-11-20 05:59:11,593 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 99 transitions. Word has length 112 [2024-11-20 05:59:11,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:59:11,597 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 99 transitions. [2024-11-20 05:59:11,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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-20 05:59:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 99 transitions. [2024-11-20 05:59:11,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 05:59:11,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:59:11,600 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, 1, 1, 1, 1] [2024-11-20 05:59:11,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 05:59:11,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:59:11,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:59:11,601 INFO L85 PathProgramCache]: Analyzing trace with hash -185023367, now seen corresponding path program 1 times [2024-11-20 05:59:11,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:59:11,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955844778] [2024-11-20 05:59:11,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:59:11,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:59:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:59:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:59:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:59:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:59:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:59:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:59:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:59:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:59:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:59:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:59:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:59:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:59:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:59:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:59:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:59:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:59:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 05:59:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:11,978 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-20 05:59:11,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:59:11,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955844778] [2024-11-20 05:59:11,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955844778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:59:11,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:59:11,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 05:59:11,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320220175] [2024-11-20 05:59:11,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:59:11,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 05:59:11,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:59:11,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 05:59:11,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 05:59:11,983 INFO L87 Difference]: Start difference. First operand 69 states and 99 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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-20 05:59:12,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:59:12,191 INFO L93 Difference]: Finished difference Result 169 states and 237 transitions. [2024-11-20 05:59:12,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 05:59:12,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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 113 [2024-11-20 05:59:12,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:59:12,193 INFO L225 Difference]: With dead ends: 169 [2024-11-20 05:59:12,193 INFO L226 Difference]: Without dead ends: 103 [2024-11-20 05:59:12,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-20 05:59:12,198 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 73 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:59:12,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 389 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:59:12,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-20 05:59:12,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2024-11-20 05:59:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 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-20 05:59:12,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2024-11-20 05:59:12,213 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 113 [2024-11-20 05:59:12,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:59:12,217 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2024-11-20 05:59:12,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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-20 05:59:12,217 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2024-11-20 05:59:12,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 05:59:12,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:59:12,219 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, 1, 1, 1, 1] [2024-11-20 05:59:12,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 05:59:12,219 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:59:12,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:59:12,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1196140617, now seen corresponding path program 1 times [2024-11-20 05:59:12,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:59:12,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770389034] [2024-11-20 05:59:12,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:59:12,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:59:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:12,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:59:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:12,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:59:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:12,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:59:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:12,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:59:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:12,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:59:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:12,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:59:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:12,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:59:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:12,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:59:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:12,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:59:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:12,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:59:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:12,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:59:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:12,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:59:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:12,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:59:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:12,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:59:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:12,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:59:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:12,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:59:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:12,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 05:59:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:12,650 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-20 05:59:12,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:59:12,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770389034] [2024-11-20 05:59:12,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770389034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:59:12,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:59:12,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 05:59:12,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26026980] [2024-11-20 05:59:12,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:59:12,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 05:59:12,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:59:12,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 05:59:12,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-20 05:59:12,653 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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-20 05:59:12,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:59:12,881 INFO L93 Difference]: Finished difference Result 192 states and 264 transitions. [2024-11-20 05:59:12,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 05:59:12,882 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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 113 [2024-11-20 05:59:12,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:59:12,885 INFO L225 Difference]: With dead ends: 192 [2024-11-20 05:59:12,887 INFO L226 Difference]: Without dead ends: 124 [2024-11-20 05:59:12,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-20 05:59:12,889 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 104 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:59:12,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 527 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:59:12,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-20 05:59:12,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 71. [2024-11-20 05:59:12,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 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-20 05:59:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2024-11-20 05:59:12,905 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 113 [2024-11-20 05:59:12,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:59:12,906 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2024-11-20 05:59:12,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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-20 05:59:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2024-11-20 05:59:12,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 05:59:12,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:59:12,908 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, 1, 1, 1, 1] [2024-11-20 05:59:12,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 05:59:12,908 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:59:12,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:59:12,909 INFO L85 PathProgramCache]: Analyzing trace with hash -937975179, now seen corresponding path program 1 times [2024-11-20 05:59:12,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:59:12,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988944942] [2024-11-20 05:59:12,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:59:12,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:59:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:13,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:59:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:13,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:59:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:13,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:59:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:13,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:59:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:13,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:59:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:13,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:59:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:13,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:59:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:13,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:59:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:13,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:59:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:13,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:59:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:13,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:59:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:13,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:59:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:13,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:59:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:13,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:59:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:13,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:59:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:13,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:59:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:13,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 05:59:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:13,333 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-20 05:59:13,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:59:13,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988944942] [2024-11-20 05:59:13,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988944942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:59:13,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:59:13,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 05:59:13,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38177873] [2024-11-20 05:59:13,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:59:13,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 05:59:13,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:59:13,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 05:59:13,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-20 05:59:13,336 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-20 05:59:13,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:59:13,509 INFO L93 Difference]: Finished difference Result 192 states and 263 transitions. [2024-11-20 05:59:13,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 05:59:13,510 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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 113 [2024-11-20 05:59:13,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:59:13,511 INFO L225 Difference]: With dead ends: 192 [2024-11-20 05:59:13,511 INFO L226 Difference]: Without dead ends: 124 [2024-11-20 05:59:13,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-20 05:59:13,513 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 76 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:59:13,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 742 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:59:13,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-20 05:59:13,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 59. [2024-11-20 05:59:13,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 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-20 05:59:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2024-11-20 05:59:13,528 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 83 transitions. Word has length 113 [2024-11-20 05:59:13,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:59:13,529 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 83 transitions. [2024-11-20 05:59:13,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-20 05:59:13,530 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 83 transitions. [2024-11-20 05:59:13,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-20 05:59:13,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:59:13,533 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, 1, 1, 1, 1, 1] [2024-11-20 05:59:13,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 05:59:13,533 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:59:13,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:59:13,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1900989205, now seen corresponding path program 1 times [2024-11-20 05:59:13,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:59:13,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83748284] [2024-11-20 05:59:13,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:59:13,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:59:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:59:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:59:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:59:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:59:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:59:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:59:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:59:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:59:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:59:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:59:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:59:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:59:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:59:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:59:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:59:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:59:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 05:59:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,111 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-20 05:59:14,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:59:14,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83748284] [2024-11-20 05:59:14,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83748284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:59:14,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:59:14,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 05:59:14,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137233155] [2024-11-20 05:59:14,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:59:14,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 05:59:14,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:59:14,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 05:59:14,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-20 05:59:14,116 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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-20 05:59:14,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:59:14,602 INFO L93 Difference]: Finished difference Result 127 states and 175 transitions. [2024-11-20 05:59:14,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 05:59:14,602 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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 114 [2024-11-20 05:59:14,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:59:14,604 INFO L225 Difference]: With dead ends: 127 [2024-11-20 05:59:14,604 INFO L226 Difference]: Without dead ends: 125 [2024-11-20 05:59:14,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-11-20 05:59:14,605 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 122 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 05:59:14,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 454 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 05:59:14,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-20 05:59:14,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2024-11-20 05:59:14,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 78 states have internal predecessors, (88), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-20 05:59:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 170 transitions. [2024-11-20 05:59:14,638 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 170 transitions. Word has length 114 [2024-11-20 05:59:14,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:59:14,639 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 170 transitions. [2024-11-20 05:59:14,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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-20 05:59:14,639 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 170 transitions. [2024-11-20 05:59:14,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 05:59:14,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:59:14,640 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, 1, 1, 1, 1, 1, 1] [2024-11-20 05:59:14,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 05:59:14,641 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:59:14,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:59:14,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1295387281, now seen corresponding path program 1 times [2024-11-20 05:59:14,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:59:14,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796997591] [2024-11-20 05:59:14,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:59:14,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:59:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:59:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:59:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:59:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:59:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:59:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:59:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:59:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:59:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:59:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:59:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:59:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:59:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:59:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:59:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:59:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:59:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 05:59:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,731 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-20 05:59:14,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:59:14,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796997591] [2024-11-20 05:59:14,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796997591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:59:14,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:59:14,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:59:14,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441317832] [2024-11-20 05:59:14,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:59:14,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:59:14,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:59:14,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:59:14,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:59:14,734 INFO L87 Difference]: Start difference. First operand 121 states and 170 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-20 05:59:14,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:59:14,807 INFO L93 Difference]: Finished difference Result 279 states and 385 transitions. [2024-11-20 05:59:14,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:59:14,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 115 [2024-11-20 05:59:14,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:59:14,811 INFO L225 Difference]: With dead ends: 279 [2024-11-20 05:59:14,811 INFO L226 Difference]: Without dead ends: 183 [2024-11-20 05:59:14,812 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-20 05:59:14,813 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 49 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:59:14,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 143 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:59:14,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-20 05:59:14,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2024-11-20 05:59:14,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 114 states have internal predecessors, (125), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-20 05:59:14,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 251 transitions. [2024-11-20 05:59:14,853 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 251 transitions. Word has length 115 [2024-11-20 05:59:14,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:59:14,853 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 251 transitions. [2024-11-20 05:59:14,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-20 05:59:14,854 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 251 transitions. [2024-11-20 05:59:14,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 05:59:14,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:59:14,855 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, 1, 1, 1, 1, 1, 1] [2024-11-20 05:59:14,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 05:59:14,856 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:59:14,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:59:14,856 INFO L85 PathProgramCache]: Analyzing trace with hash 515115771, now seen corresponding path program 1 times [2024-11-20 05:59:14,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:59:14,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415999315] [2024-11-20 05:59:14,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:59:14,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:59:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:59:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:59:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:59:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:59:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:59:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:59:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:59:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:59:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:59:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:59:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:59:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:59:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:59:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:59:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:59:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:59:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 05:59:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:14,944 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-20 05:59:14,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:59:14,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415999315] [2024-11-20 05:59:14,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415999315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:59:14,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:59:14,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:59:14,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607694675] [2024-11-20 05:59:14,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:59:14,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:59:14,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:59:14,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:59:14,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:59:14,946 INFO L87 Difference]: Start difference. First operand 180 states and 251 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-20 05:59:15,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:59:15,004 INFO L93 Difference]: Finished difference Result 312 states and 429 transitions. [2024-11-20 05:59:15,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:59:15,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 115 [2024-11-20 05:59:15,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:59:15,007 INFO L225 Difference]: With dead ends: 312 [2024-11-20 05:59:15,007 INFO L226 Difference]: Without dead ends: 161 [2024-11-20 05:59:15,008 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-20 05:59:15,009 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 47 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:59:15,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 166 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:59:15,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-20 05:59:15,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 130. [2024-11-20 05:59:15,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 83 states have (on average 1.1325301204819278) internal successors, (94), 85 states have internal predecessors, (94), 41 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-20 05:59:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 176 transitions. [2024-11-20 05:59:15,030 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 176 transitions. Word has length 115 [2024-11-20 05:59:15,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:59:15,032 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 176 transitions. [2024-11-20 05:59:15,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-20 05:59:15,032 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 176 transitions. [2024-11-20 05:59:15,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 05:59:15,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:59:15,033 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, 1, 1, 1, 1, 1, 1] [2024-11-20 05:59:15,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 05:59:15,034 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:59:15,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:59:15,034 INFO L85 PathProgramCache]: Analyzing trace with hash -956762095, now seen corresponding path program 1 times [2024-11-20 05:59:15,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:59:15,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872782433] [2024-11-20 05:59:15,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:59:15,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:59:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:15,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:59:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:15,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:59:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:15,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:59:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:15,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:59:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:15,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:59:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:15,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:59:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:15,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:59:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:15,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:59:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:15,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:59:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:15,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:59:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:15,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:59:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:15,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:59:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:15,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:59:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:15,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:59:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:15,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:59:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:15,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:59:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:15,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 05:59:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:15,376 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-20 05:59:15,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:59:15,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872782433] [2024-11-20 05:59:15,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872782433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:59:15,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:59:15,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 05:59:15,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234355005] [2024-11-20 05:59:15,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:59:15,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 05:59:15,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:59:15,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 05:59:15,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-20 05:59:15,378 INFO L87 Difference]: Start difference. First operand 130 states and 176 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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-20 05:59:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:59:15,814 INFO L93 Difference]: Finished difference Result 173 states and 230 transitions. [2024-11-20 05:59:15,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 05:59:15,815 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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 115 [2024-11-20 05:59:15,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:59:15,817 INFO L225 Difference]: With dead ends: 173 [2024-11-20 05:59:15,817 INFO L226 Difference]: Without dead ends: 171 [2024-11-20 05:59:15,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-20 05:59:15,818 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 106 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 05:59:15,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 620 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 05:59:15,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-20 05:59:15,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 143. [2024-11-20 05:59:15,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 96 states have (on average 1.1145833333333333) internal successors, (107), 98 states have internal predecessors, (107), 41 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-20 05:59:15,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 189 transitions. [2024-11-20 05:59:15,846 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 189 transitions. Word has length 115 [2024-11-20 05:59:15,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:59:15,846 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 189 transitions. [2024-11-20 05:59:15,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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-20 05:59:15,847 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 189 transitions. [2024-11-20 05:59:15,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 05:59:15,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:59:15,848 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:59:15,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 05:59:15,849 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:59:15,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:59:15,850 INFO L85 PathProgramCache]: Analyzing trace with hash 211692513, now seen corresponding path program 1 times [2024-11-20 05:59:15,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:59:15,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686481256] [2024-11-20 05:59:15,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:59:15,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:59:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 05:59:15,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [166477762] [2024-11-20 05:59:15,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:59:15,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:59:15,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:59:15,901 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 05:59:15,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 05:59:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:16,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-20 05:59:16,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:59:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 235 proven. 39 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-11-20 05:59:19,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:59:23,009 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-20 05:59:23,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:59:23,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686481256] [2024-11-20 05:59:23,011 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 05:59:23,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166477762] [2024-11-20 05:59:23,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166477762] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 05:59:23,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 05:59:23,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2024-11-20 05:59:23,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772440968] [2024-11-20 05:59:23,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 05:59:23,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-20 05:59:23,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:59:23,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-20 05:59:23,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-11-20 05:59:23,014 INFO L87 Difference]: Start difference. First operand 143 states and 189 transitions. Second operand has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 05:59:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:59:24,211 INFO L93 Difference]: Finished difference Result 196 states and 251 transitions. [2024-11-20 05:59:24,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-20 05:59:24,212 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 116 [2024-11-20 05:59:24,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:59:24,215 INFO L225 Difference]: With dead ends: 196 [2024-11-20 05:59:24,215 INFO L226 Difference]: Without dead ends: 194 [2024-11-20 05:59:24,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2024-11-20 05:59:24,216 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 136 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 05:59:24,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 715 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 05:59:24,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-20 05:59:24,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 146. [2024-11-20 05:59:24,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 97 states have (on average 1.1134020618556701) internal successors, (108), 99 states have internal predecessors, (108), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-20 05:59:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2024-11-20 05:59:24,236 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 116 [2024-11-20 05:59:24,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:59:24,239 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2024-11-20 05:59:24,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 05:59:24,239 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2024-11-20 05:59:24,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 05:59:24,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:59:24,241 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:59:24,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 05:59:24,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-20 05:59:24,442 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:59:24,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:59:24,443 INFO L85 PathProgramCache]: Analyzing trace with hash -561945216, now seen corresponding path program 1 times [2024-11-20 05:59:24,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:59:24,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185099978] [2024-11-20 05:59:24,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:59:24,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:59:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:24,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:59:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:24,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:59:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:24,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:59:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:24,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:59:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:24,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:59:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:24,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:59:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:24,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:59:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:24,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:59:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:24,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:59:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:24,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:59:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:24,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:59:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:24,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:59:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:24,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:59:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:24,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:59:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:24,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:59:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:24,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:59:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:24,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 05:59:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:24,953 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-20 05:59:24,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:59:24,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185099978] [2024-11-20 05:59:24,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185099978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:59:24,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:59:24,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 05:59:24,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093411882] [2024-11-20 05:59:24,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:59:24,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 05:59:24,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:59:24,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 05:59:24,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-20 05:59:24,956 INFO L87 Difference]: Start difference. First operand 146 states and 190 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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-20 05:59:25,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:59:25,371 INFO L93 Difference]: Finished difference Result 170 states and 214 transitions. [2024-11-20 05:59:25,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 05:59:25,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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 116 [2024-11-20 05:59:25,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:59:25,373 INFO L225 Difference]: With dead ends: 170 [2024-11-20 05:59:25,373 INFO L226 Difference]: Without dead ends: 168 [2024-11-20 05:59:25,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-20 05:59:25,375 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 72 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 05:59:25,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 542 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 05:59:25,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-20 05:59:25,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 146. [2024-11-20 05:59:25,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 97 states have (on average 1.1134020618556701) internal successors, (108), 99 states have internal predecessors, (108), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-20 05:59:25,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2024-11-20 05:59:25,392 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 116 [2024-11-20 05:59:25,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:59:25,392 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2024-11-20 05:59:25,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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-20 05:59:25,393 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2024-11-20 05:59:25,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 05:59:25,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:59:25,394 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:59:25,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 05:59:25,394 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:59:25,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:59:25,395 INFO L85 PathProgramCache]: Analyzing trace with hash -954972226, now seen corresponding path program 1 times [2024-11-20 05:59:25,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:59:25,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312900897] [2024-11-20 05:59:25,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:59:25,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:59:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:59:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:59:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:59:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:59:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:59:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:59:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:59:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:59:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:59:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:59:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:59:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:59:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:59:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:59:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:59:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:59:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 05:59:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,979 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-20 05:59:25,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:59:25,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312900897] [2024-11-20 05:59:25,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312900897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:59:25,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:59:25,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 05:59:25,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858668496] [2024-11-20 05:59:25,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:59:25,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 05:59:25,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:59:25,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 05:59:25,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-20 05:59:25,982 INFO L87 Difference]: Start difference. First operand 146 states and 190 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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-20 05:59:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:59:26,337 INFO L93 Difference]: Finished difference Result 162 states and 206 transitions. [2024-11-20 05:59:26,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 05:59:26,338 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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 116 [2024-11-20 05:59:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:59:26,339 INFO L225 Difference]: With dead ends: 162 [2024-11-20 05:59:26,339 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 05:59:26,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-20 05:59:26,340 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 77 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 05:59:26,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 412 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 05:59:26,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 05:59:26,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 05:59:26,342 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-20 05:59:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 05:59:26,343 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2024-11-20 05:59:26,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:59:26,343 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 05:59:26,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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-20 05:59:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 05:59:26,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 05:59:26,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 05:59:26,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 05:59:26,349 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:59:26,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 05:59:26,990 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 05:59:27,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:59:27 BoogieIcfgContainer [2024-11-20 05:59:27,011 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 05:59:27,012 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 05:59:27,012 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 05:59:27,012 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 05:59:27,013 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:59:08" (3/4) ... [2024-11-20 05:59:27,015 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 05:59:27,019 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-20 05:59:27,024 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-20 05:59:27,024 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-20 05:59:27,025 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 05:59:27,025 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 05:59:27,132 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 05:59:27,132 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 05:59:27,132 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 05:59:27,133 INFO L158 Benchmark]: Toolchain (without parser) took 19544.79ms. Allocated memory was 159.4MB in the beginning and 629.1MB in the end (delta: 469.8MB). Free memory was 88.0MB in the beginning and 250.8MB in the end (delta: -162.9MB). Peak memory consumption was 308.3MB. Max. memory is 16.1GB. [2024-11-20 05:59:27,133 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:59:27,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.00ms. Allocated memory is still 159.4MB. Free memory was 87.8MB in the beginning and 73.6MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 05:59:27,134 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.23ms. Allocated memory is still 159.4MB. Free memory was 73.6MB in the beginning and 129.5MB in the end (delta: -55.9MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-11-20 05:59:27,134 INFO L158 Benchmark]: Boogie Preprocessor took 56.49ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 129.5MB in the beginning and 180.4MB in the end (delta: -50.9MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-11-20 05:59:27,134 INFO L158 Benchmark]: RCFGBuilder took 487.22ms. Allocated memory is still 209.7MB. Free memory was 180.4MB in the beginning and 161.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-20 05:59:27,134 INFO L158 Benchmark]: TraceAbstraction took 18505.35ms. Allocated memory was 209.7MB in the beginning and 629.1MB in the end (delta: 419.4MB). Free memory was 161.5MB in the beginning and 257.1MB in the end (delta: -95.6MB). Peak memory consumption was 323.8MB. Max. memory is 16.1GB. [2024-11-20 05:59:27,135 INFO L158 Benchmark]: Witness Printer took 120.56ms. Allocated memory is still 629.1MB. Free memory was 257.1MB in the beginning and 250.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 05:59:27,136 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.20ms. Allocated memory is still 159.4MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.00ms. Allocated memory is still 159.4MB. Free memory was 87.8MB in the beginning and 73.6MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.23ms. Allocated memory is still 159.4MB. Free memory was 73.6MB in the beginning and 129.5MB in the end (delta: -55.9MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.49ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 129.5MB in the beginning and 180.4MB in the end (delta: -50.9MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * RCFGBuilder took 487.22ms. Allocated memory is still 209.7MB. Free memory was 180.4MB in the beginning and 161.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 18505.35ms. Allocated memory was 209.7MB in the beginning and 629.1MB in the end (delta: 419.4MB). Free memory was 161.5MB in the beginning and 257.1MB in the end (delta: -95.6MB). Peak memory consumption was 323.8MB. Max. memory is 16.1GB. * Witness Printer took 120.56ms. Allocated memory is still 629.1MB. Free memory was 257.1MB in the beginning and 250.8MB 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, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.8s, OverallIterations: 13, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 991 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 955 mSDsluCounter, 5514 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4151 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3054 IncrementalHoareTripleChecker+Invalid, 3110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 1363 mSDtfsCounter, 3054 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 780 GetRequests, 671 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=8, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 350 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 1598 NumberOfCodeBlocks, 1598 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1584 ConstructedInterpolants, 12 QuantifiedInterpolants, 4913 SizeOfPredicates, 13 NumberOfNonLiveVariables, 265 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 7565/7616 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: 106]: Loop Invariant Derived loop invariant: (((0 <= var_1_11) && (var_1_13 == var_1_16)) || (((var_1_16 != 0) && (0 <= var_1_11)) && (var_1_11 != 0))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((cond != 0) && (((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (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_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (last_1_var_1_12 == \old(last_1_var_1_12)))) RESULT: Ultimate proved your program to be correct! [2024-11-20 05:59:27,172 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