./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-97.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-97.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 3ba38ef6acc82fdb63f92a7590a6e53b41a3fa91ed0f40b85a8a30577d3cb67b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:21:25,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:21:25,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:21:25,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:21:25,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:21:25,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:21:25,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:21:25,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:21:25,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:21:25,854 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:21:25,854 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:21:25,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:21:25,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:21:25,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:21:25,858 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:21:25,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:21:25,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:21:25,859 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:21:25,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:21:25,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:21:25,860 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:21:25,864 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:21:25,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:21:25,865 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:21:25,865 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:21:25,865 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:21:25,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:21:25,866 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:21:25,866 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:21:25,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:21:25,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:21:25,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:21:25,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:21:25,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:21:25,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:21:25,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:21:25,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:21:25,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:21:25,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:21:25,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:21:25,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:21:25,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:21:25,870 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 -> 3ba38ef6acc82fdb63f92a7590a6e53b41a3fa91ed0f40b85a8a30577d3cb67b [2024-10-24 10:21:26,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:21:26,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:21:26,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:21:26,143 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:21:26,143 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:21:26,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-97.i [2024-10-24 10:21:27,652 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:21:27,843 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:21:27,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-97.i [2024-10-24 10:21:27,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2916aba/4677aea9ce0f4cd2ad5ba18a10e27701/FLAG3bbf55bd5 [2024-10-24 10:21:27,867 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2916aba/4677aea9ce0f4cd2ad5ba18a10e27701 [2024-10-24 10:21:27,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:21:27,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:21:27,875 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:21:27,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:21:27,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:21:27,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:21:27" (1/1) ... [2024-10-24 10:21:27,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7596d202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:21:27, skipping insertion in model container [2024-10-24 10:21:27,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:21:27" (1/1) ... [2024-10-24 10:21:27,916 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:21:28,085 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-97.i[915,928] [2024-10-24 10:21:28,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:21:28,129 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:21:28,138 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-97.i[915,928] [2024-10-24 10:21:28,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:21:28,164 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:21:28,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:21:28 WrapperNode [2024-10-24 10:21:28,165 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:21:28,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:21:28,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:21:28,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:21:28,172 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:21:28" (1/1) ... [2024-10-24 10:21:28,179 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:21:28" (1/1) ... [2024-10-24 10:21:28,197 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2024-10-24 10:21:28,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:21:28,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:21:28,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:21:28,199 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:21:28,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:21:28" (1/1) ... [2024-10-24 10:21:28,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:21:28" (1/1) ... [2024-10-24 10:21:28,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:21:28" (1/1) ... [2024-10-24 10:21:28,222 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:21:28,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:21:28" (1/1) ... [2024-10-24 10:21:28,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:21:28" (1/1) ... [2024-10-24 10:21:28,226 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:21:28" (1/1) ... [2024-10-24 10:21:28,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:21:28" (1/1) ... [2024-10-24 10:21:28,231 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:21:28" (1/1) ... [2024-10-24 10:21:28,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:21:28" (1/1) ... [2024-10-24 10:21:28,234 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:21:28,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:21:28,235 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:21:28,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:21:28,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:21:28" (1/1) ... [2024-10-24 10:21:28,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:21:28,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:21:28,270 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:21:28,289 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:21:28,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:21:28,362 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:21:28,362 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:21:28,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:21:28,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:21:28,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:21:28,435 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:21:28,439 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:21:28,687 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-24 10:21:28,691 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:21:28,733 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:21:28,734 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:21:28,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:21:28 BoogieIcfgContainer [2024-10-24 10:21:28,734 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:21:28,736 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:21:28,736 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:21:28,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:21:28,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:21:27" (1/3) ... [2024-10-24 10:21:28,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72dd96d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:21:28, skipping insertion in model container [2024-10-24 10:21:28,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:21:28" (2/3) ... [2024-10-24 10:21:28,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72dd96d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:21:28, skipping insertion in model container [2024-10-24 10:21:28,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:21:28" (3/3) ... [2024-10-24 10:21:28,742 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-97.i [2024-10-24 10:21:28,756 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:21:28,757 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:21:28,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:21:28,817 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;@484f5e7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:21:28,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:21:28,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 10:21:28,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 10:21:28,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:21:28,830 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:28,830 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:21:28,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:21:28,835 INFO L85 PathProgramCache]: Analyzing trace with hash 614006356, now seen corresponding path program 1 times [2024-10-24 10:21:28,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:21:28,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879105662] [2024-10-24 10:21:28,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:21:28,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:21:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:29,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:21:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:29,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:21:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:29,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:21:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:29,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:21:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:29,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:21:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:29,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:21:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:29,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:21:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:29,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:21:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:29,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:21:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:29,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:21:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 10:21:29,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:21:29,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879105662] [2024-10-24 10:21:29,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879105662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:21:29,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:21:29,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:21:29,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295167204] [2024-10-24 10:21:29,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:21:29,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:21:29,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:21:29,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:21:29,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:21:29,131 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 10:21:29,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:21:29,161 INFO L93 Difference]: Finished difference Result 77 states and 126 transitions. [2024-10-24 10:21:29,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:21:29,165 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 65 [2024-10-24 10:21:29,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:21:29,172 INFO L225 Difference]: With dead ends: 77 [2024-10-24 10:21:29,172 INFO L226 Difference]: Without dead ends: 38 [2024-10-24 10:21:29,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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:21:29,178 INFO L432 NwaCegarLoop]: 51 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, 51 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:21:29,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:21:29,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-24 10:21:29,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-24 10:21:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 10:21:29,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 54 transitions. [2024-10-24 10:21:29,215 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 54 transitions. Word has length 65 [2024-10-24 10:21:29,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:21:29,215 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 54 transitions. [2024-10-24 10:21:29,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 10:21:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 54 transitions. [2024-10-24 10:21:29,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 10:21:29,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:21:29,219 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:29,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:21:29,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:21:29,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:21:29,221 INFO L85 PathProgramCache]: Analyzing trace with hash -410815212, now seen corresponding path program 1 times [2024-10-24 10:21:29,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:21:29,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582994803] [2024-10-24 10:21:29,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:21:29,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:21:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:21:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:21:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:21:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:21:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:21:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:21:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:21:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:21:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:21:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:21:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,131 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 10:21:30,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:21:30,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582994803] [2024-10-24 10:21:30,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582994803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:21:30,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:21:30,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:21:30,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659143044] [2024-10-24 10:21:30,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:21:30,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:21:30,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:21:30,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:21:30,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:21:30,140 INFO L87 Difference]: Start difference. First operand 38 states and 54 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:21:30,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:21:30,428 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2024-10-24 10:21:30,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:21:30,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 65 [2024-10-24 10:21:30,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:21:30,431 INFO L225 Difference]: With dead ends: 64 [2024-10-24 10:21:30,431 INFO L226 Difference]: Without dead ends: 62 [2024-10-24 10:21:30,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:21:30,434 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 28 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:21:30,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 225 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:21:30,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-24 10:21:30,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2024-10-24 10:21:30,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 43 states have internal predecessors, (54), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 10:21:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2024-10-24 10:21:30,475 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 65 [2024-10-24 10:21:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:21:30,476 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2024-10-24 10:21:30,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:21:30,477 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2024-10-24 10:21:30,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-24 10:21:30,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:21:30,479 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:30,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:21:30,480 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:21:30,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:21:30,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1805282460, now seen corresponding path program 1 times [2024-10-24 10:21:30,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:21:30,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302458502] [2024-10-24 10:21:30,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:21:30,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:21:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:21:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:21:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:21:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:21:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:21:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:21:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:21:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:21:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:21:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:21:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,592 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 10:21:30,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:21:30,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302458502] [2024-10-24 10:21:30,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302458502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:21:30,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:21:30,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:21:30,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817837338] [2024-10-24 10:21:30,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:21:30,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 10:21:30,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:21:30,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 10:21:30,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:21:30,598 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:21:30,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:21:30,682 INFO L93 Difference]: Finished difference Result 120 states and 166 transitions. [2024-10-24 10:21:30,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 10:21:30,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2024-10-24 10:21:30,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:21:30,686 INFO L225 Difference]: With dead ends: 120 [2024-10-24 10:21:30,686 INFO L226 Difference]: Without dead ends: 62 [2024-10-24 10:21:30,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:21:30,687 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 12 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:21:30,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 107 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:21:30,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-24 10:21:30,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2024-10-24 10:21:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 43 states have internal predecessors, (53), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 10:21:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2024-10-24 10:21:30,705 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 66 [2024-10-24 10:21:30,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:21:30,706 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2024-10-24 10:21:30,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:21:30,707 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2024-10-24 10:21:30,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-24 10:21:30,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:21:30,709 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:30,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 10:21:30,709 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:21:30,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:21:30,709 INFO L85 PathProgramCache]: Analyzing trace with hash 339717640, now seen corresponding path program 1 times [2024-10-24 10:21:30,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:21:30,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497457117] [2024-10-24 10:21:30,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:21:30,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:21:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:21:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:21:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:21:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:21:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:21:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:21:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:21:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:21:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:21:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:21:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,809 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 10:21:30,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:21:30,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497457117] [2024-10-24 10:21:30,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497457117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:21:30,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:21:30,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:21:30,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500888839] [2024-10-24 10:21:30,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:21:30,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 10:21:30,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:21:30,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 10:21:30,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:21:30,812 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:21:30,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:21:30,884 INFO L93 Difference]: Finished difference Result 112 states and 153 transitions. [2024-10-24 10:21:30,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 10:21:30,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-10-24 10:21:30,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:21:30,886 INFO L225 Difference]: With dead ends: 112 [2024-10-24 10:21:30,886 INFO L226 Difference]: Without dead ends: 54 [2024-10-24 10:21:30,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:21:30,887 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:21:30,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 113 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:21:30,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-24 10:21:30,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2024-10-24 10:21:30,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 37 states have internal predecessors, (43), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 10:21:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2024-10-24 10:21:30,903 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 67 [2024-10-24 10:21:30,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:21:30,905 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2024-10-24 10:21:30,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:21:30,905 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2024-10-24 10:21:30,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 10:21:30,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:21:30,908 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:30,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 10:21:30,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:21:30,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:21:30,909 INFO L85 PathProgramCache]: Analyzing trace with hash -294198384, now seen corresponding path program 1 times [2024-10-24 10:21:30,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:21:30,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890493738] [2024-10-24 10:21:30,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:21:30,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:21:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:30,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:21:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:31,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:21:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:31,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:21:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:31,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:21:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:31,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:21:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:31,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:21:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:31,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:21:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:31,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:21:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:31,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:21:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:31,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:21:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:31,025 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 10:21:31,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:21:31,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890493738] [2024-10-24 10:21:31,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890493738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:21:31,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:21:31,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:21:31,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830356048] [2024-10-24 10:21:31,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:21:31,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:21:31,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:21:31,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:21:31,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:21:31,029 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:21:31,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:21:31,104 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2024-10-24 10:21:31,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:21:31,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 68 [2024-10-24 10:21:31,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:21:31,107 INFO L225 Difference]: With dead ends: 64 [2024-10-24 10:21:31,108 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 10:21:31,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:21:31,111 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 21 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:21:31,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 218 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:21:31,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 10:21:31,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 10:21:31,115 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:21:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 10:21:31,115 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2024-10-24 10:21:31,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:21:31,116 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 10:21:31,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:21:31,116 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 10:21:31,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 10:21:31,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:21:31,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 10:21:31,125 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-24 10:21:31,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 10:21:31,317 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:21:31,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:21:31 BoogieIcfgContainer [2024-10-24 10:21:31,339 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:21:31,339 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:21:31,339 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:21:31,340 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:21:31,340 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:21:28" (3/4) ... [2024-10-24 10:21:31,343 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 10:21:31,347 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 10:21:31,354 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-24 10:21:31,354 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-24 10:21:31,355 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 10:21:31,355 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 10:21:31,457 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 10:21:31,458 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 10:21:31,458 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:21:31,459 INFO L158 Benchmark]: Toolchain (without parser) took 3586.73ms. Allocated memory was 153.1MB in the beginning and 205.5MB in the end (delta: 52.4MB). Free memory was 85.8MB in the beginning and 145.7MB in the end (delta: -59.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:21:31,459 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 113.2MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:21:31,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.11ms. Allocated memory is still 153.1MB. Free memory was 85.6MB in the beginning and 72.9MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 10:21:31,459 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.93ms. Allocated memory is still 153.1MB. Free memory was 72.7MB in the beginning and 70.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:21:31,460 INFO L158 Benchmark]: Boogie Preprocessor took 35.54ms. Allocated memory is still 153.1MB. Free memory was 70.9MB in the beginning and 69.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:21:31,460 INFO L158 Benchmark]: RCFGBuilder took 499.90ms. Allocated memory is still 153.1MB. Free memory was 68.8MB in the beginning and 113.3MB in the end (delta: -44.5MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2024-10-24 10:21:31,460 INFO L158 Benchmark]: TraceAbstraction took 2602.54ms. Allocated memory was 153.1MB in the beginning and 205.5MB in the end (delta: 52.4MB). Free memory was 112.2MB in the beginning and 151.1MB in the end (delta: -38.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 10:21:31,460 INFO L158 Benchmark]: Witness Printer took 118.83ms. Allocated memory is still 205.5MB. Free memory was 151.1MB in the beginning and 145.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 10:21:31,462 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.26ms. Allocated memory is still 113.2MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.11ms. Allocated memory is still 153.1MB. Free memory was 85.6MB in the beginning and 72.9MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.93ms. Allocated memory is still 153.1MB. Free memory was 72.7MB in the beginning and 70.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.54ms. Allocated memory is still 153.1MB. Free memory was 70.9MB in the beginning and 69.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 499.90ms. Allocated memory is still 153.1MB. Free memory was 68.8MB in the beginning and 113.3MB in the end (delta: -44.5MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2602.54ms. Allocated memory was 153.1MB in the beginning and 205.5MB in the end (delta: 52.4MB). Free memory was 112.2MB in the beginning and 151.1MB in the end (delta: -38.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 118.83ms. Allocated memory is still 205.5MB. Free memory was 151.1MB in the beginning and 145.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 714 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 443 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 177 IncrementalHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 271 mSDtfsCounter, 177 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=2, InterpolantAutomatonStates: 20, 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, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 326 ConstructedInterpolants, 0 QuantifiedInterpolants, 722 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 900/900 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: 69]: 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_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) RESULT: Ultimate proved your program to be correct! [2024-10-24 10:21:31,490 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