./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.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 03532d804e91a228e512382776942639e7b4d586babdb4cf497abfe139412ab5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:25:48,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:25:48,105 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:25:48,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:25:48,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:25:48,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:25:48,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:25:48,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:25:48,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:25:48,137 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:25:48,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:25:48,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:25:48,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:25:48,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:25:48,139 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:25:48,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:25:48,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:25:48,140 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:25:48,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:25:48,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:25:48,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:25:48,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:25:48,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:25:48,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:25:48,144 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:25:48,144 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:25:48,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:25:48,144 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:25:48,144 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:25:48,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:25:48,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:25:48,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:25:48,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:25:48,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:25:48,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:25:48,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:25:48,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:25:48,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:25:48,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:25:48,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:25:48,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:25:48,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:25:48,147 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 -> 03532d804e91a228e512382776942639e7b4d586babdb4cf497abfe139412ab5 [2024-11-10 07:25:48,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:25:48,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:25:48,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:25:48,359 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:25:48,360 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:25:48,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i [2024-11-10 07:25:49,562 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:25:49,708 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:25:49,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i [2024-11-10 07:25:49,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d6b1cbeb/8a9acb1768754032955ace96cf16079d/FLAG6050da91d [2024-11-10 07:25:49,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d6b1cbeb/8a9acb1768754032955ace96cf16079d [2024-11-10 07:25:49,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:25:49,735 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:25:49,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:25:49,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:25:49,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:25:49,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:25:49" (1/1) ... [2024-11-10 07:25:49,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1272ced0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:49, skipping insertion in model container [2024-11-10 07:25:49,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:25:49" (1/1) ... [2024-11-10 07:25:49,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:25:49,877 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i[914,927] [2024-11-10 07:25:49,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:25:49,917 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:25:49,925 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i[914,927] [2024-11-10 07:25:49,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:25:49,992 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:25:49,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:49 WrapperNode [2024-11-10 07:25:49,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:25:49,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:25:49,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:25:49,994 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:25:49,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:49" (1/1) ... [2024-11-10 07:25:50,023 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:49" (1/1) ... [2024-11-10 07:25:50,050 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2024-11-10 07:25:50,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:25:50,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:25:50,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:25:50,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:25:50,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:49" (1/1) ... [2024-11-10 07:25:50,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:49" (1/1) ... [2024-11-10 07:25:50,066 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:49" (1/1) ... [2024-11-10 07:25:50,086 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-10 07:25:50,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:49" (1/1) ... [2024-11-10 07:25:50,087 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:49" (1/1) ... [2024-11-10 07:25:50,091 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:49" (1/1) ... [2024-11-10 07:25:50,092 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:49" (1/1) ... [2024-11-10 07:25:50,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:49" (1/1) ... [2024-11-10 07:25:50,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:49" (1/1) ... [2024-11-10 07:25:50,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:25:50,096 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:25:50,096 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:25:50,096 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:25:50,097 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:49" (1/1) ... [2024-11-10 07:25:50,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:25:50,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:25:50,136 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-10 07:25:50,138 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-10 07:25:50,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:25:50,172 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:25:50,172 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:25:50,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:25:50,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:25:50,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:25:50,236 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:25:50,240 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:25:50,489 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-10 07:25:50,490 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:25:50,501 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:25:50,504 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:25:50,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:25:50 BoogieIcfgContainer [2024-11-10 07:25:50,505 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:25:50,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:25:50,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:25:50,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:25:50,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:25:49" (1/3) ... [2024-11-10 07:25:50,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a99eda1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:25:50, skipping insertion in model container [2024-11-10 07:25:50,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:49" (2/3) ... [2024-11-10 07:25:50,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a99eda1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:25:50, skipping insertion in model container [2024-11-10 07:25:50,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:25:50" (3/3) ... [2024-11-10 07:25:50,514 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-5.i [2024-11-10 07:25:50,526 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:25:50,526 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:25:50,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:25:50,580 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;@4ba36526, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:25:50,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:25:50,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 07:25:50,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 07:25:50,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:25:50,596 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:25:50,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:25:50,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:25:50,602 INFO L85 PathProgramCache]: Analyzing trace with hash 885180676, now seen corresponding path program 1 times [2024-11-10 07:25:50,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:25:50,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309806353] [2024-11-10 07:25:50,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:25:50,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:25:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:50,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:25:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:50,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:25:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:50,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:25:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:50,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:25:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:50,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:25:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:50,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:25:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:50,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:25:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:50,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:25:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:50,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:25:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:50,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:25:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:50,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:25:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:50,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:25:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:50,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:25:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:50,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:25:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 07:25:50,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:25:50,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309806353] [2024-11-10 07:25:50,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309806353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:25:50,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:25:50,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:25:50,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562453962] [2024-11-10 07:25:50,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:25:50,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:25:50,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:25:50,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:25:50,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:25:50,876 INFO L87 Difference]: Start difference. First operand has 52 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 07:25:50,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:25:50,893 INFO L93 Difference]: Finished difference Result 100 states and 158 transitions. [2024-11-10 07:25:50,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:25:50,895 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2024-11-10 07:25:50,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:25:50,900 INFO L225 Difference]: With dead ends: 100 [2024-11-10 07:25:50,900 INFO L226 Difference]: Without dead ends: 47 [2024-11-10 07:25:50,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-10 07:25:50,905 INFO L432 NwaCegarLoop]: 70 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, 70 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-10 07:25:50,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:25:50,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-10 07:25:50,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-10 07:25:50,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 07:25:50,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2024-11-10 07:25:50,936 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 95 [2024-11-10 07:25:50,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:25:50,937 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2024-11-10 07:25:50,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 07:25:50,937 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2024-11-10 07:25:50,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 07:25:50,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:25:50,941 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:25:50,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:25:50,941 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:25:50,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:25:50,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1525067876, now seen corresponding path program 1 times [2024-11-10 07:25:50,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:25:50,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921819141] [2024-11-10 07:25:50,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:25:50,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:25:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:52,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:25:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:52,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:25:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:52,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:25:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:52,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:25:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:52,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:25:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:52,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:25:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:52,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:25:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:52,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:25:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:52,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:25:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:52,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:25:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:52,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:25:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:52,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:25:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:52,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:25:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:52,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:25:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:52,251 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 07:25:52,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:25:52,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921819141] [2024-11-10 07:25:52,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921819141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:25:52,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:25:52,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:25:52,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943480418] [2024-11-10 07:25:52,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:25:52,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:25:52,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:25:52,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:25:52,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:25:52,259 INFO L87 Difference]: Start difference. First operand 47 states and 66 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 07:25:52,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:25:52,526 INFO L93 Difference]: Finished difference Result 168 states and 236 transitions. [2024-11-10 07:25:52,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:25:52,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2024-11-10 07:25:52,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:25:52,530 INFO L225 Difference]: With dead ends: 168 [2024-11-10 07:25:52,530 INFO L226 Difference]: Without dead ends: 124 [2024-11-10 07:25:52,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:25:52,532 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 66 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:25:52,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 202 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:25:52,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-10 07:25:52,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 115. [2024-11-10 07:25:52,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 74 states have internal predecessors, (87), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-10 07:25:52,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2024-11-10 07:25:52,558 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 95 [2024-11-10 07:25:52,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:25:52,560 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2024-11-10 07:25:52,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 07:25:52,560 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2024-11-10 07:25:52,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 07:25:52,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:25:52,562 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:25:52,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:25:52,564 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:25:52,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:25:52,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1553697027, now seen corresponding path program 1 times [2024-11-10 07:25:52,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:25:52,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278469491] [2024-11-10 07:25:52,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:25:52,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:25:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:54,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:25:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:54,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:25:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:54,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:25:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:54,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:25:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:54,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:25:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:54,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:25:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:54,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:25:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:54,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:25:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:54,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:25:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:54,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:25:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:54,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:25:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:54,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:25:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:54,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:25:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:54,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:25:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 07:25:54,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:25:54,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278469491] [2024-11-10 07:25:54,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278469491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:25:54,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:25:54,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 07:25:54,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389405450] [2024-11-10 07:25:54,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:25:54,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 07:25:54,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:25:54,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 07:25:54,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 07:25:54,526 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 07:25:55,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:25:55,124 INFO L93 Difference]: Finished difference Result 134 states and 182 transitions. [2024-11-10 07:25:55,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:25:55,125 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2024-11-10 07:25:55,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:25:55,128 INFO L225 Difference]: With dead ends: 134 [2024-11-10 07:25:55,129 INFO L226 Difference]: Without dead ends: 131 [2024-11-10 07:25:55,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-10 07:25:55,133 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 104 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 07:25:55,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 274 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 07:25:55,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-10 07:25:55,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2024-11-10 07:25:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 79 states have internal predecessors, (92), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-10 07:25:55,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2024-11-10 07:25:55,154 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 95 [2024-11-10 07:25:55,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:25:55,155 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2024-11-10 07:25:55,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 07:25:55,155 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2024-11-10 07:25:55,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 07:25:55,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:25:55,156 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:25:55,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 07:25:55,157 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:25:55,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:25:55,157 INFO L85 PathProgramCache]: Analyzing trace with hash -998459934, now seen corresponding path program 1 times [2024-11-10 07:25:55,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:25:55,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707827218] [2024-11-10 07:25:55,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:25:55,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:25:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:25:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:25:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:25:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:25:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:25:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:25:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:25:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:25:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:25:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:25:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:25:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:25:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:25:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:25:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 07:25:55,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:25:55,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707827218] [2024-11-10 07:25:55,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707827218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:25:55,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:25:55,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:25:55,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096667217] [2024-11-10 07:25:55,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:25:55,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:25:55,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:25:55,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:25:55,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:25:55,238 INFO L87 Difference]: Start difference. First operand 120 states and 168 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 07:25:55,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:25:55,256 INFO L93 Difference]: Finished difference Result 232 states and 327 transitions. [2024-11-10 07:25:55,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:25:55,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2024-11-10 07:25:55,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:25:55,257 INFO L225 Difference]: With dead ends: 232 [2024-11-10 07:25:55,257 INFO L226 Difference]: Without dead ends: 115 [2024-11-10 07:25:55,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-10 07:25:55,259 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:25:55,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:25:55,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-10 07:25:55,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-10 07:25:55,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 74 states have internal predecessors, (83), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-10 07:25:55,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 159 transitions. [2024-11-10 07:25:55,272 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 159 transitions. Word has length 95 [2024-11-10 07:25:55,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:25:55,273 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 159 transitions. [2024-11-10 07:25:55,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 07:25:55,273 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 159 transitions. [2024-11-10 07:25:55,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 07:25:55,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:25:55,275 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:25:55,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 07:25:55,275 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:25:55,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:25:55,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1328554371, now seen corresponding path program 1 times [2024-11-10 07:25:55,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:25:55,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812242556] [2024-11-10 07:25:55,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:25:55,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:25:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:25:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:25:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:25:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:25:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:25:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:25:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:25:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:25:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:25:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:25:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:25:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:25:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:25:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:25:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 07:25:55,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:25:55,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812242556] [2024-11-10 07:25:55,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812242556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:25:55,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:25:55,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:25:55,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985512668] [2024-11-10 07:25:55,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:25:55,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:25:55,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:25:55,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:25:55,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:25:55,344 INFO L87 Difference]: Start difference. First operand 115 states and 159 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 07:25:55,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:25:55,362 INFO L93 Difference]: Finished difference Result 219 states and 305 transitions. [2024-11-10 07:25:55,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:25:55,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2024-11-10 07:25:55,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:25:55,364 INFO L225 Difference]: With dead ends: 219 [2024-11-10 07:25:55,366 INFO L226 Difference]: Without dead ends: 107 [2024-11-10 07:25:55,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-10 07:25:55,367 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:25:55,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:25:55,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-10 07:25:55,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-10 07:25:55,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 66 states have internal predecessors, (71), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-10 07:25:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 147 transitions. [2024-11-10 07:25:55,390 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 147 transitions. Word has length 95 [2024-11-10 07:25:55,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:25:55,391 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 147 transitions. [2024-11-10 07:25:55,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 07:25:55,391 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 147 transitions. [2024-11-10 07:25:55,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 07:25:55,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:25:55,392 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:25:55,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 07:25:55,393 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:25:55,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:25:55,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1151111682, now seen corresponding path program 1 times [2024-11-10 07:25:55,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:25:55,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814147092] [2024-11-10 07:25:55,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:25:55,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:25:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:25:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:25:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:25:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:25:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:25:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:25:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:25:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:25:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:25:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:25:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:25:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:25:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:25:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:25:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:55,700 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 07:25:55,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:25:55,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814147092] [2024-11-10 07:25:55,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814147092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:25:55,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:25:55,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:25:55,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017487606] [2024-11-10 07:25:55,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:25:55,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:25:55,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:25:55,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:25:55,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:25:55,707 INFO L87 Difference]: Start difference. First operand 107 states and 147 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 07:25:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:25:55,777 INFO L93 Difference]: Finished difference Result 156 states and 212 transitions. [2024-11-10 07:25:55,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:25:55,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 96 [2024-11-10 07:25:55,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:25:55,779 INFO L225 Difference]: With dead ends: 156 [2024-11-10 07:25:55,780 INFO L226 Difference]: Without dead ends: 112 [2024-11-10 07:25:55,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:25:55,781 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 38 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:25:55,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 151 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:25:55,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-10 07:25:55,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-10 07:25:55,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 69 states have internal predecessors, (73), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-10 07:25:55,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 149 transitions. [2024-11-10 07:25:55,801 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 149 transitions. Word has length 96 [2024-11-10 07:25:55,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:25:55,802 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 149 transitions. [2024-11-10 07:25:55,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 07:25:55,802 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 149 transitions. [2024-11-10 07:25:55,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 07:25:55,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:25:55,803 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:25:55,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 07:25:55,804 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:25:55,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:25:55,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1179740833, now seen corresponding path program 1 times [2024-11-10 07:25:55,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:25:55,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777640349] [2024-11-10 07:25:55,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:25:55,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:25:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:56,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:25:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:56,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:25:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:56,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:25:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:56,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:25:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:56,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:25:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:56,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:25:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:56,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:25:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:56,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:25:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:56,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:25:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:56,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:25:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:56,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:25:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:56,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:25:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:56,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:25:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:56,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:25:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:56,878 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 07:25:56,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:25:56,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777640349] [2024-11-10 07:25:56,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777640349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:25:56,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:25:56,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 07:25:56,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922806635] [2024-11-10 07:25:56,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:25:56,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 07:25:56,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:25:56,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 07:25:56,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:25:56,880 INFO L87 Difference]: Start difference. First operand 111 states and 149 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 07:25:57,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:25:57,070 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2024-11-10 07:25:57,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 07:25:57,071 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 96 [2024-11-10 07:25:57,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:25:57,073 INFO L225 Difference]: With dead ends: 133 [2024-11-10 07:25:57,073 INFO L226 Difference]: Without dead ends: 130 [2024-11-10 07:25:57,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-10 07:25:57,074 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 12 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:25:57,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 408 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:25:57,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-10 07:25:57,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 120. [2024-11-10 07:25:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 78 states have internal predecessors, (82), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-10 07:25:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 158 transitions. [2024-11-10 07:25:57,094 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 158 transitions. Word has length 96 [2024-11-10 07:25:57,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:25:57,094 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 158 transitions. [2024-11-10 07:25:57,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 07:25:57,095 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 158 transitions. [2024-11-10 07:25:57,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 07:25:57,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:25:57,096 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:25:57,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 07:25:57,097 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:25:57,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:25:57,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1627029255, now seen corresponding path program 1 times [2024-11-10 07:25:57,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:25:57,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469021940] [2024-11-10 07:25:57,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:25:57,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:25:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:57,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:25:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:57,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:25:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:57,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:25:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:57,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:25:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:57,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:25:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:57,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:25:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:57,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:25:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:57,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:25:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:57,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:25:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:57,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:25:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:57,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:25:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:57,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:25:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:57,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:25:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:57,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:25:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 07:25:57,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:25:57,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469021940] [2024-11-10 07:25:57,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469021940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:25:57,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:25:57,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 07:25:57,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832540804] [2024-11-10 07:25:57,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:25:57,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 07:25:57,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:25:57,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 07:25:57,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:25:57,733 INFO L87 Difference]: Start difference. First operand 120 states and 158 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 07:25:57,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:25:57,848 INFO L93 Difference]: Finished difference Result 150 states and 188 transitions. [2024-11-10 07:25:57,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 07:25:57,848 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2024-11-10 07:25:57,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:25:57,849 INFO L225 Difference]: With dead ends: 150 [2024-11-10 07:25:57,849 INFO L226 Difference]: Without dead ends: 147 [2024-11-10 07:25:57,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-10 07:25:57,850 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 37 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:25:57,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 310 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:25:57,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-10 07:25:57,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 120. [2024-11-10 07:25:57,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 78 states have internal predecessors, (82), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-10 07:25:57,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 158 transitions. [2024-11-10 07:25:57,864 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 158 transitions. Word has length 97 [2024-11-10 07:25:57,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:25:57,865 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 158 transitions. [2024-11-10 07:25:57,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 07:25:57,865 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 158 transitions. [2024-11-10 07:25:57,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 07:25:57,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:25:57,866 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:25:57,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 07:25:57,866 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:25:57,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:25:57,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1756111974, now seen corresponding path program 1 times [2024-11-10 07:25:57,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:25:57,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919241707] [2024-11-10 07:25:57,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:25:57,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:25:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:59,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:25:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:59,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:25:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:59,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:25:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:59,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:25:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:59,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:25:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:59,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:25:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:59,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:25:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:59,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:25:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:59,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:25:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:59,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:25:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:59,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:25:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:59,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:25:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:59,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:25:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:59,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:25:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:25:59,567 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 07:25:59,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:25:59,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919241707] [2024-11-10 07:25:59,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919241707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:25:59,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:25:59,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 07:25:59,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376850675] [2024-11-10 07:25:59,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:25:59,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 07:25:59,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:25:59,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 07:25:59,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:25:59,569 INFO L87 Difference]: Start difference. First operand 120 states and 158 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 07:26:00,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:26:00,008 INFO L93 Difference]: Finished difference Result 144 states and 183 transitions. [2024-11-10 07:26:00,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 07:26:00,009 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2024-11-10 07:26:00,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:26:00,010 INFO L225 Difference]: With dead ends: 144 [2024-11-10 07:26:00,010 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 07:26:00,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2024-11-10 07:26:00,011 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 35 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:26:00,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 321 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:26:00,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 07:26:00,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 07:26:00,012 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-10 07:26:00,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 07:26:00,012 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2024-11-10 07:26:00,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:26:00,012 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 07:26:00,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 07:26:00,012 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 07:26:00,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 07:26:00,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:26:00,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 07:26:00,019 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:26:00,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 07:26:00,319 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:26:00,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:26:00 BoogieIcfgContainer [2024-11-10 07:26:00,339 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:26:00,340 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:26:00,340 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:26:00,340 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:26:00,340 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:25:50" (3/4) ... [2024-11-10 07:26:00,342 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 07:26:00,345 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 07:26:00,348 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-10 07:26:00,350 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-10 07:26:00,350 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 07:26:00,350 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 07:26:00,428 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 07:26:00,428 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 07:26:00,428 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:26:00,429 INFO L158 Benchmark]: Toolchain (without parser) took 10693.64ms. Allocated memory was 174.1MB in the beginning and 448.8MB in the end (delta: 274.7MB). Free memory was 107.0MB in the beginning and 306.4MB in the end (delta: -199.3MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. [2024-11-10 07:26:00,429 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 174.1MB. Free memory was 130.6MB in the beginning and 130.5MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:26:00,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.56ms. Allocated memory is still 174.1MB. Free memory was 106.8MB in the beginning and 146.1MB in the end (delta: -39.3MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-11-10 07:26:00,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.64ms. Allocated memory is still 174.1MB. Free memory was 146.1MB in the beginning and 142.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 07:26:00,430 INFO L158 Benchmark]: Boogie Preprocessor took 44.96ms. Allocated memory is still 174.1MB. Free memory was 142.6MB in the beginning and 138.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 07:26:00,430 INFO L158 Benchmark]: IcfgBuilder took 408.77ms. Allocated memory is still 174.1MB. Free memory was 138.4MB in the beginning and 121.0MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 07:26:00,430 INFO L158 Benchmark]: TraceAbstraction took 9832.52ms. Allocated memory was 174.1MB in the beginning and 448.8MB in the end (delta: 274.7MB). Free memory was 120.2MB in the beginning and 311.6MB in the end (delta: -191.4MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. [2024-11-10 07:26:00,430 INFO L158 Benchmark]: Witness Printer took 89.03ms. Allocated memory is still 448.8MB. Free memory was 311.6MB in the beginning and 306.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 07:26:00,431 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.16ms. Allocated memory is still 174.1MB. Free memory was 130.6MB in the beginning and 130.5MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.56ms. Allocated memory is still 174.1MB. Free memory was 106.8MB in the beginning and 146.1MB in the end (delta: -39.3MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.64ms. Allocated memory is still 174.1MB. Free memory was 146.1MB in the beginning and 142.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.96ms. Allocated memory is still 174.1MB. Free memory was 142.6MB in the beginning and 138.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 408.77ms. Allocated memory is still 174.1MB. Free memory was 138.4MB in the beginning and 121.0MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9832.52ms. Allocated memory was 174.1MB in the beginning and 448.8MB in the end (delta: 274.7MB). Free memory was 120.2MB in the beginning and 311.6MB in the end (delta: -191.4MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. * Witness Printer took 89.03ms. Allocated memory is still 448.8MB. Free memory was 311.6MB in the beginning and 306.4MB in the end (delta: 5.2MB). 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, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 9, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 292 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 292 mSDsluCounter, 1984 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1363 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 808 IncrementalHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 621 mSDtfsCounter, 808 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=3, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 58 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 861 NumberOfCodeBlocks, 861 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 852 ConstructedInterpolants, 0 QuantifiedInterpolants, 3408 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 3276/3276 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: 96]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_4 == \old(var_1_4))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (last_1_var_1_8 == \old(last_1_var_1_8))) RESULT: Ultimate proved your program to be correct! [2024-11-10 07:26:00,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE