./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-52.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 b5838620bd457809ceed4f0c203968d420f7009ec8bbf098cce61ac908814018 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:19:29,617 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:19:29,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:19:29,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:19:29,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:19:29,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:19:29,727 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:19:29,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:19:29,728 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:19:29,730 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:19:29,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:19:29,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:19:29,732 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:19:29,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:19:29,735 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:19:29,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:19:29,736 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:19:29,736 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:19:29,736 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:19:29,737 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:19:29,737 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:19:29,738 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:19:29,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:19:29,739 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:19:29,739 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:19:29,739 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:19:29,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:19:29,739 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:19:29,740 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:19:29,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:19:29,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:19:29,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:19:29,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:19:29,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:19:29,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:19:29,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:19:29,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:19:29,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:19:29,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:19:29,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:19:29,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:19:29,744 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:19:29,744 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 -> b5838620bd457809ceed4f0c203968d420f7009ec8bbf098cce61ac908814018 [2024-10-24 10:19:29,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:19:30,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:19:30,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:19:30,010 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:19:30,011 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:19:30,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-52.i [2024-10-24 10:19:31,520 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:19:31,734 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:19:31,735 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-52.i [2024-10-24 10:19:31,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32683f0fe/1466da7606414d3a81b27fd0e4d71321/FLAG5f9252501 [2024-10-24 10:19:32,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32683f0fe/1466da7606414d3a81b27fd0e4d71321 [2024-10-24 10:19:32,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:19:32,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:19:32,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:19:32,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:19:32,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:19:32,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:19:32" (1/1) ... [2024-10-24 10:19:32,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a60630d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:32, skipping insertion in model container [2024-10-24 10:19:32,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:19:32" (1/1) ... [2024-10-24 10:19:32,142 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:19:32,321 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-52.i[915,928] [2024-10-24 10:19:32,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:19:32,360 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:19:32,370 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-52.i[915,928] [2024-10-24 10:19:32,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:19:32,399 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:19:32,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:32 WrapperNode [2024-10-24 10:19:32,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:19:32,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:19:32,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:19:32,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:19:32,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:32" (1/1) ... [2024-10-24 10:19:32,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:32" (1/1) ... [2024-10-24 10:19:32,437 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 63 [2024-10-24 10:19:32,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:19:32,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:19:32,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:19:32,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:19:32,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:32" (1/1) ... [2024-10-24 10:19:32,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:32" (1/1) ... [2024-10-24 10:19:32,451 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:32" (1/1) ... [2024-10-24 10:19:32,475 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:19:32,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:32" (1/1) ... [2024-10-24 10:19:32,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:32" (1/1) ... [2024-10-24 10:19:32,479 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:32" (1/1) ... [2024-10-24 10:19:32,482 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:32" (1/1) ... [2024-10-24 10:19:32,484 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:32" (1/1) ... [2024-10-24 10:19:32,485 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:32" (1/1) ... [2024-10-24 10:19:32,487 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:19:32,488 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:19:32,488 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:19:32,489 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:19:32,489 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:32" (1/1) ... [2024-10-24 10:19:32,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:19:32,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:19:32,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:19:32,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:19:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:19:32,566 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:19:32,566 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:19:32,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:19:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:19:32,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:19:32,621 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:19:32,623 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:19:32,817 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 10:19:32,818 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:19:32,852 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:19:32,852 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:19:32,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:19:32 BoogieIcfgContainer [2024-10-24 10:19:32,853 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:19:32,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:19:32,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:19:32,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:19:32,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:19:32" (1/3) ... [2024-10-24 10:19:32,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31edd2a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:19:32, skipping insertion in model container [2024-10-24 10:19:32,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:32" (2/3) ... [2024-10-24 10:19:32,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31edd2a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:19:32, skipping insertion in model container [2024-10-24 10:19:32,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:19:32" (3/3) ... [2024-10-24 10:19:32,861 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-52.i [2024-10-24 10:19:32,877 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:19:32,877 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:19:32,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:19:32,949 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;@16b1f2ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:19:32,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:19:32,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 10:19:32,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-24 10:19:32,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:19:32,961 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:19:32,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:19:32,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:19:32,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1410145867, now seen corresponding path program 1 times [2024-10-24 10:19:32,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:19:32,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857214857] [2024-10-24 10:19:32,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:19:32,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:19:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:33,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:19:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:33,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:19:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:33,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:19:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:33,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:19:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:33,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:19:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:33,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:19:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-24 10:19:33,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:19:33,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857214857] [2024-10-24 10:19:33,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857214857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:19:33,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:19:33,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:19:33,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108379194] [2024-10-24 10:19:33,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:19:33,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:19:33,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:19:33,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:19:33,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:19:33,243 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 10:19:33,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:19:33,277 INFO L93 Difference]: Finished difference Result 49 states and 78 transitions. [2024-10-24 10:19:33,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:19:33,282 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2024-10-24 10:19:33,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:19:33,289 INFO L225 Difference]: With dead ends: 49 [2024-10-24 10:19:33,290 INFO L226 Difference]: Without dead ends: 24 [2024-10-24 10:19:33,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:19:33,297 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:19:33,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:19:33,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-24 10:19:33,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-24 10:19:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 10:19:33,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2024-10-24 10:19:33,330 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 41 [2024-10-24 10:19:33,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:19:33,330 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2024-10-24 10:19:33,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 10:19:33,331 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2024-10-24 10:19:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-24 10:19:33,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:19:33,333 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:19:33,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:19:33,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:19:33,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:19:33,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1156287755, now seen corresponding path program 1 times [2024-10-24 10:19:33,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:19:33,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545364111] [2024-10-24 10:19:33,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:19:33,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:19:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:34,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:19:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:34,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:19:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:34,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:19:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:34,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:19:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:34,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:19:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:34,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:19:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:34,076 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-24 10:19:34,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:19:34,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545364111] [2024-10-24 10:19:34,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545364111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:19:34,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:19:34,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:19:34,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497675451] [2024-10-24 10:19:34,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:19:34,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:19:34,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:19:34,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:19:34,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:19:34,081 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:19:34,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:19:34,216 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-10-24 10:19:34,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:19:34,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 41 [2024-10-24 10:19:34,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:19:34,218 INFO L225 Difference]: With dead ends: 36 [2024-10-24 10:19:34,218 INFO L226 Difference]: Without dead ends: 34 [2024-10-24 10:19:34,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:19:34,221 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:19:34,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 67 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:19:34,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-24 10:19:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2024-10-24 10:19:34,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 10:19:34,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2024-10-24 10:19:34,231 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 41 [2024-10-24 10:19:34,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:19:34,233 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2024-10-24 10:19:34,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:19:34,234 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2024-10-24 10:19:34,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 10:19:34,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:19:34,235 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:19:34,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:19:34,235 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:19:34,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:19:34,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1476254337, now seen corresponding path program 1 times [2024-10-24 10:19:34,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:19:34,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121219426] [2024-10-24 10:19:34,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:19:34,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:19:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:34,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:19:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:34,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:19:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:34,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:19:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:34,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:19:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:34,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:19:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:34,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:19:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-24 10:19:34,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:19:34,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121219426] [2024-10-24 10:19:34,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121219426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:19:34,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:19:34,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 10:19:34,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505981745] [2024-10-24 10:19:34,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:19:34,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 10:19:34,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:19:34,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 10:19:34,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:19:34,739 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:19:34,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:19:34,857 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-10-24 10:19:34,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 10:19:34,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2024-10-24 10:19:34,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:19:34,859 INFO L225 Difference]: With dead ends: 35 [2024-10-24 10:19:34,859 INFO L226 Difference]: Without dead ends: 33 [2024-10-24 10:19:34,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:19:34,860 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:19:34,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 90 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:19:34,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-24 10:19:34,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2024-10-24 10:19:34,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 10:19:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2024-10-24 10:19:34,873 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 42 [2024-10-24 10:19:34,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:19:34,873 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2024-10-24 10:19:34,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:19:34,874 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2024-10-24 10:19:34,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 10:19:34,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:19:34,875 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:19:34,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 10:19:34,876 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:19:34,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:19:34,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1476313919, now seen corresponding path program 1 times [2024-10-24 10:19:34,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:19:34,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430947804] [2024-10-24 10:19:34,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:19:34,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:19:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:35,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:19:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:35,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:19:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:35,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:19:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:35,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:19:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:35,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:19:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:35,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:19:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-24 10:19:35,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:19:35,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430947804] [2024-10-24 10:19:35,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430947804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:19:35,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:19:35,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 10:19:35,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280677328] [2024-10-24 10:19:35,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:19:35,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 10:19:35,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:19:35,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 10:19:35,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:19:35,549 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:19:35,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:19:35,823 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2024-10-24 10:19:35,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 10:19:35,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2024-10-24 10:19:35,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:19:35,824 INFO L225 Difference]: With dead ends: 27 [2024-10-24 10:19:35,825 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 10:19:35,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:19:35,828 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:19:35,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:19:35,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 10:19:35,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 10:19:35,833 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-10-24 10:19:35,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 10:19:35,833 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2024-10-24 10:19:35,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:19:35,833 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 10:19:35,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:19:35,833 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 10:19:35,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 10:19:35,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:19:35,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 10:19:35,842 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 10:19:35,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 10:19:35,862 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:19:35,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:19:35 BoogieIcfgContainer [2024-10-24 10:19:35,882 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:19:35,882 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:19:35,883 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:19:35,883 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:19:35,883 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:19:32" (3/4) ... [2024-10-24 10:19:35,885 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 10:19:35,889 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 10:19:35,894 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-24 10:19:35,894 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-24 10:19:35,894 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 10:19:35,895 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 10:19:35,985 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 10:19:35,985 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 10:19:35,985 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:19:35,986 INFO L158 Benchmark]: Toolchain (without parser) took 3875.95ms. Allocated memory was 140.5MB in the beginning and 172.0MB in the end (delta: 31.5MB). Free memory was 90.6MB in the beginning and 128.3MB in the end (delta: -37.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:19:35,986 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 140.5MB. Free memory is still 101.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:19:35,986 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.51ms. Allocated memory is still 140.5MB. Free memory was 90.2MB in the beginning and 77.2MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 10:19:35,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.87ms. Allocated memory is still 140.5MB. Free memory was 77.2MB in the beginning and 75.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:19:35,987 INFO L158 Benchmark]: Boogie Preprocessor took 48.54ms. Allocated memory is still 140.5MB. Free memory was 75.6MB in the beginning and 73.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:19:35,987 INFO L158 Benchmark]: RCFGBuilder took 365.12ms. Allocated memory was 140.5MB in the beginning and 172.0MB in the end (delta: 31.5MB). Free memory was 73.1MB in the beginning and 141.2MB in the end (delta: -68.1MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-10-24 10:19:35,988 INFO L158 Benchmark]: TraceAbstraction took 3026.49ms. Allocated memory is still 172.0MB. Free memory was 140.2MB in the beginning and 133.6MB in the end (delta: 6.6MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-10-24 10:19:35,990 INFO L158 Benchmark]: Witness Printer took 102.83ms. Allocated memory is still 172.0MB. Free memory was 133.6MB in the beginning and 128.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 10:19:35,991 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.23ms. Allocated memory is still 140.5MB. Free memory is still 101.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.51ms. Allocated memory is still 140.5MB. Free memory was 90.2MB in the beginning and 77.2MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.87ms. Allocated memory is still 140.5MB. Free memory was 77.2MB in the beginning and 75.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.54ms. Allocated memory is still 140.5MB. Free memory was 75.6MB in the beginning and 73.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 365.12ms. Allocated memory was 140.5MB in the beginning and 172.0MB in the end (delta: 31.5MB). Free memory was 73.1MB in the beginning and 141.2MB in the end (delta: -68.1MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3026.49ms. Allocated memory is still 172.0MB. Free memory was 140.2MB in the beginning and 133.6MB in the end (delta: 6.6MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Witness Printer took 102.83ms. Allocated memory is still 172.0MB. Free memory was 133.6MB in the beginning and 128.3MB 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, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 256 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 154 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 123 IncrementalHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 102 mSDtfsCounter, 123 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 637 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 240/240 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: 62]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (last_1_var_1_7 == \old(last_1_var_1_7))) RESULT: Ultimate proved your program to be correct! [2024-10-24 10:19:36,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE