./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.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 66787726949481a4f01caef79c3e8fdad3a573b5b9ad657da2a70c5a83f1feb5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:17:25,776 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:17:25,837 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:17:25,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:17:25,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:17:25,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:17:25,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:17:25,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:17:25,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:17:25,864 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:17:25,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:17:25,864 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:17:25,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:17:25,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:17:25,867 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:17:25,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:17:25,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:17:25,867 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:17:25,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:17:25,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:17:25,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:17:25,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:17:25,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:17:25,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:17:25,871 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:17:25,871 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:17:25,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:17:25,871 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:17:25,871 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:17:25,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:17:25,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:17:25,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:17:25,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:17:25,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:17:25,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:17:25,872 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:17:25,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:17:25,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:17:25,873 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:17:25,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:17:25,873 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:17:25,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:17:25,873 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 -> 66787726949481a4f01caef79c3e8fdad3a573b5b9ad657da2a70c5a83f1feb5 [2024-11-10 08:17:26,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:17:26,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:17:26,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:17:26,083 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:17:26,084 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:17:26,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.i [2024-11-10 08:17:27,294 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:17:27,459 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:17:27,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.i [2024-11-10 08:17:27,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46a5eb324/6bbc86681dd147f7b09ef59ac92fe841/FLAG296e40de9 [2024-11-10 08:17:27,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46a5eb324/6bbc86681dd147f7b09ef59ac92fe841 [2024-11-10 08:17:27,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:17:27,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:17:27,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:17:27,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:17:27,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:17:27,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:17:27" (1/1) ... [2024-11-10 08:17:27,877 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f63d312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:27, skipping insertion in model container [2024-11-10 08:17:27,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:17:27" (1/1) ... [2024-11-10 08:17:27,891 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:17:28,057 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.i[915,928] [2024-11-10 08:17:28,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:17:28,086 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:17:28,095 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.i[915,928] [2024-11-10 08:17:28,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:17:28,118 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:17:28,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:28 WrapperNode [2024-11-10 08:17:28,118 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:17:28,119 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:17:28,119 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:17:28,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:17:28,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:28" (1/1) ... [2024-11-10 08:17:28,129 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:28" (1/1) ... [2024-11-10 08:17:28,144 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 72 [2024-11-10 08:17:28,144 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:17:28,144 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:17:28,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:17:28,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:17:28,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:28" (1/1) ... [2024-11-10 08:17:28,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:28" (1/1) ... [2024-11-10 08:17:28,158 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:28" (1/1) ... [2024-11-10 08:17:28,168 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 08:17:28,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:28" (1/1) ... [2024-11-10 08:17:28,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:28" (1/1) ... [2024-11-10 08:17:28,172 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:28" (1/1) ... [2024-11-10 08:17:28,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:28" (1/1) ... [2024-11-10 08:17:28,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:28" (1/1) ... [2024-11-10 08:17:28,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:28" (1/1) ... [2024-11-10 08:17:28,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:17:28,177 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:17:28,177 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:17:28,177 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:17:28,177 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:28" (1/1) ... [2024-11-10 08:17:28,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:17:28,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:17:28,204 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 08:17:28,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 08:17:28,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:17:28,247 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:17:28,247 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:17:28,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:17:28,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:17:28,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:17:28,303 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:17:28,306 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:17:28,461 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 08:17:28,461 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:17:28,476 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:17:28,477 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:17:28,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:17:28 BoogieIcfgContainer [2024-11-10 08:17:28,477 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:17:28,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:17:28,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:17:28,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:17:28,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:17:27" (1/3) ... [2024-11-10 08:17:28,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2303a02a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:17:28, skipping insertion in model container [2024-11-10 08:17:28,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:28" (2/3) ... [2024-11-10 08:17:28,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2303a02a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:17:28, skipping insertion in model container [2024-11-10 08:17:28,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:17:28" (3/3) ... [2024-11-10 08:17:28,486 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-43.i [2024-11-10 08:17:28,499 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:17:28,499 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:17:28,555 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:17:28,563 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;@521e9c80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:17:28,563 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:17:28,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 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-11-10 08:17:28,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 08:17:28,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:17:28,575 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-11-10 08:17:28,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:17:28,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:17:28,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1323160470, now seen corresponding path program 1 times [2024-11-10 08:17:28,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:17:28,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858898687] [2024-11-10 08:17:28,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:17:28,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:17:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:28,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:17:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:28,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:17:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:28,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:17:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:28,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:17:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:28,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:17:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:28,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:17:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:28,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:17:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:28,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:17:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:28,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:17:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:28,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:17:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 08:17:28,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:17:28,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858898687] [2024-11-10 08:17:28,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858898687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:17:28,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:17:28,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:17:28,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897244540] [2024-11-10 08:17:28,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:17:28,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:17:28,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:17:28,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:17:28,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:17:28,800 INFO L87 Difference]: Start difference. First operand has 41 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 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 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-11-10 08:17:28,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:17:28,818 INFO L93 Difference]: Finished difference Result 74 states and 117 transitions. [2024-11-10 08:17:28,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:17:28,820 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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 68 [2024-11-10 08:17:28,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:17:28,824 INFO L225 Difference]: With dead ends: 74 [2024-11-10 08:17:28,824 INFO L226 Difference]: Without dead ends: 36 [2024-11-10 08:17:28,827 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-11-10 08:17:28,829 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:17:28,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:17:28,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-10 08:17:28,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-10 08:17:28,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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-11-10 08:17:28,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-10 08:17:28,857 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 68 [2024-11-10 08:17:28,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:17:28,857 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-10 08:17:28,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-11-10 08:17:28,858 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-10 08:17:28,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 08:17:28,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:17:28,862 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-11-10 08:17:28,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:17:28,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:17:28,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:17:28,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1201142518, now seen corresponding path program 1 times [2024-11-10 08:17:28,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:17:28,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693189158] [2024-11-10 08:17:28,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:17:28,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:17:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:29,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:17:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:29,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:17:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:29,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:17:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:29,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:17:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:29,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:17:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:29,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:17:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:29,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:17:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:29,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:17:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:29,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:17:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:29,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:17:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:29,452 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 08:17:29,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:17:29,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693189158] [2024-11-10 08:17:29,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693189158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:17:29,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:17:29,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:17:29,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316052090] [2024-11-10 08:17:29,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:17:29,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:17:29,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:17:29,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:17:29,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:17:29,456 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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-11-10 08:17:29,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:17:29,557 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2024-11-10 08:17:29,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:17:29,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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-11-10 08:17:29,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:17:29,560 INFO L225 Difference]: With dead ends: 56 [2024-11-10 08:17:29,561 INFO L226 Difference]: Without dead ends: 53 [2024-11-10 08:17:29,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:17:29,562 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 16 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:17:29,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 222 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:17:29,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-10 08:17:29,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2024-11-10 08:17:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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-11-10 08:17:29,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2024-11-10 08:17:29,569 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 68 [2024-11-10 08:17:29,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:17:29,571 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2024-11-10 08:17:29,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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-11-10 08:17:29,571 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2024-11-10 08:17:29,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 08:17:29,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:17:29,574 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-11-10 08:17:29,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:17:29,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:17:29,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:17:29,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1172513367, now seen corresponding path program 1 times [2024-11-10 08:17:29,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:17:29,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425745432] [2024-11-10 08:17:29,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:17:29,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:17:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:29,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:17:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:29,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:17:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:29,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:17:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:29,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:17:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:29,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:17:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:29,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:17:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:29,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:17:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:29,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:17:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:29,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:17:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:29,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:17:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 08:17:29,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:17:29,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425745432] [2024-11-10 08:17:29,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425745432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:17:29,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:17:29,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:17:29,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852926312] [2024-11-10 08:17:29,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:17:29,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:17:29,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:17:29,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:17:29,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:17:29,900 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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-11-10 08:17:29,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:17:29,984 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2024-11-10 08:17:29,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:17:29,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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-11-10 08:17:29,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:17:29,985 INFO L225 Difference]: With dead ends: 53 [2024-11-10 08:17:29,985 INFO L226 Difference]: Without dead ends: 50 [2024-11-10 08:17:29,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:17:29,988 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 13 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:17:29,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 205 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:17:29,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-10 08:17:29,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 39. [2024-11-10 08:17:29,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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-11-10 08:17:29,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2024-11-10 08:17:29,998 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 68 [2024-11-10 08:17:29,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:17:29,998 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2024-11-10 08:17:29,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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-11-10 08:17:29,999 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2024-11-10 08:17:30,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 08:17:30,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:17:30,002 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-11-10 08:17:30,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 08:17:30,002 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:17:30,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:17:30,003 INFO L85 PathProgramCache]: Analyzing trace with hash -170493082, now seen corresponding path program 1 times [2024-11-10 08:17:30,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:17:30,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91765734] [2024-11-10 08:17:30,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:17:30,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:17:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:17:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:17:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:17:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:17:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:17:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:17:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:17:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:17:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:17:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:17:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,205 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 08:17:30,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:17:30,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91765734] [2024-11-10 08:17:30,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91765734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:17:30,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:17:30,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 08:17:30,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723776386] [2024-11-10 08:17:30,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:17:30,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 08:17:30,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:17:30,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 08:17:30,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:17:30,208 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-11-10 08:17:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:17:30,295 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-11-10 08:17:30,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 08:17:30,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-11-10 08:17:30,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:17:30,299 INFO L225 Difference]: With dead ends: 49 [2024-11-10 08:17:30,299 INFO L226 Difference]: Without dead ends: 46 [2024-11-10 08:17:30,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 08:17:30,300 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 247 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.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:17:30,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 247 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:17:30,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-10 08:17:30,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2024-11-10 08:17:30,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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-11-10 08:17:30,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2024-11-10 08:17:30,310 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 68 [2024-11-10 08:17:30,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:17:30,310 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2024-11-10 08:17:30,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-11-10 08:17:30,311 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2024-11-10 08:17:30,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 08:17:30,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:17:30,313 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, 1] [2024-11-10 08:17:30,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 08:17:30,313 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:17:30,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:17:30,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1790026851, now seen corresponding path program 1 times [2024-11-10 08:17:30,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:17:30,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356565856] [2024-11-10 08:17:30,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:17:30,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:17:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:17:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:17:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:17:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:17:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:17:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:17:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:17:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:17:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:17:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:17:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,578 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 08:17:30,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:17:30,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356565856] [2024-11-10 08:17:30,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356565856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:17:30,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:17:30,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:17:30,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054512638] [2024-11-10 08:17:30,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:17:30,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:17:30,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:17:30,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:17:30,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:17:30,580 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-11-10 08:17:30,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:17:30,666 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2024-11-10 08:17:30,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:17:30,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 69 [2024-11-10 08:17:30,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:17:30,668 INFO L225 Difference]: With dead ends: 56 [2024-11-10 08:17:30,669 INFO L226 Difference]: Without dead ends: 53 [2024-11-10 08:17:30,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:17:30,670 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 19 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:17:30,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 201 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:17:30,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-10 08:17:30,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2024-11-10 08:17:30,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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-11-10 08:17:30,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2024-11-10 08:17:30,676 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 69 [2024-11-10 08:17:30,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:17:30,677 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2024-11-10 08:17:30,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-11-10 08:17:30,677 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2024-11-10 08:17:30,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 08:17:30,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:17:30,678 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, 1] [2024-11-10 08:17:30,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 08:17:30,678 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:17:30,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:17:30,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1761397700, now seen corresponding path program 1 times [2024-11-10 08:17:30,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:17:30,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590356984] [2024-11-10 08:17:30,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:17:30,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:17:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:17:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:17:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:17:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:17:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:17:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:17:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:17:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:17:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:17:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:17:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:30,778 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 08:17:30,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:17:30,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590356984] [2024-11-10 08:17:30,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590356984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:17:30,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:17:30,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:17:30,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058666304] [2024-11-10 08:17:30,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:17:30,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:17:30,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:17:30,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:17:30,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:17:30,780 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-11-10 08:17:30,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:17:30,826 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2024-11-10 08:17:30,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:17:30,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 69 [2024-11-10 08:17:30,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:17:30,827 INFO L225 Difference]: With dead ends: 50 [2024-11-10 08:17:30,827 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 08:17:30,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:17:30,828 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 16 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:17:30,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 192 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:17:30,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 08:17:30,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 08:17:30,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 08:17:30,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 08:17:30,829 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2024-11-10 08:17:30,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:17:30,830 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 08:17:30,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-11-10 08:17:30,830 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 08:17:30,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 08:17:30,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:17:30,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 08:17:30,837 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 08:17:30,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 08:17:30,864 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:17:30,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:17:30 BoogieIcfgContainer [2024-11-10 08:17:30,881 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:17:30,882 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:17:30,882 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:17:30,882 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:17:30,883 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:17:28" (3/4) ... [2024-11-10 08:17:30,885 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 08:17:30,888 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 08:17:30,892 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-10 08:17:30,892 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-10 08:17:30,892 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 08:17:30,892 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 08:17:30,966 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 08:17:30,966 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 08:17:30,966 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:17:30,966 INFO L158 Benchmark]: Toolchain (without parser) took 3095.59ms. Allocated memory was 169.9MB in the beginning and 226.5MB in the end (delta: 56.6MB). Free memory was 102.3MB in the beginning and 188.9MB in the end (delta: -86.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:17:30,967 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:17:30,967 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.68ms. Allocated memory is still 169.9MB. Free memory was 102.1MB in the beginning and 136.5MB in the end (delta: -34.4MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2024-11-10 08:17:30,967 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.92ms. Allocated memory is still 169.9MB. Free memory was 136.5MB in the beginning and 134.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:17:30,967 INFO L158 Benchmark]: Boogie Preprocessor took 31.61ms. Allocated memory is still 169.9MB. Free memory was 134.5MB in the beginning and 133.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:17:30,967 INFO L158 Benchmark]: IcfgBuilder took 300.56ms. Allocated memory is still 169.9MB. Free memory was 133.2MB in the beginning and 119.8MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 08:17:30,967 INFO L158 Benchmark]: TraceAbstraction took 2401.70ms. Allocated memory was 169.9MB in the beginning and 226.5MB in the end (delta: 56.6MB). Free memory was 119.2MB in the beginning and 194.1MB in the end (delta: -75.0MB). Peak memory consumption was 112.7MB. Max. memory is 16.1GB. [2024-11-10 08:17:30,967 INFO L158 Benchmark]: Witness Printer took 84.18ms. Allocated memory is still 226.5MB. Free memory was 194.1MB in the beginning and 188.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 08:17:30,969 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.13ms. Allocated memory is still 104.9MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.68ms. Allocated memory is still 169.9MB. Free memory was 102.1MB in the beginning and 136.5MB in the end (delta: -34.4MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.92ms. Allocated memory is still 169.9MB. Free memory was 136.5MB in the beginning and 134.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.61ms. Allocated memory is still 169.9MB. Free memory was 134.5MB in the beginning and 133.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 300.56ms. Allocated memory is still 169.9MB. Free memory was 133.2MB in the beginning and 119.8MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2401.70ms. Allocated memory was 169.9MB in the beginning and 226.5MB in the end (delta: 56.6MB). Free memory was 119.2MB in the beginning and 194.1MB in the end (delta: -75.0MB). Peak memory consumption was 112.7MB. Max. memory is 16.1GB. * Witness Printer took 84.18ms. Allocated memory is still 226.5MB. Free memory was 194.1MB in the beginning and 188.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 1116 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 807 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 174 IncrementalHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 309 mSDtfsCounter, 174 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, InterpolantAutomatonStates: 33, 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, 6 MinimizatonAttempts, 46 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 410 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 404 ConstructedInterpolants, 0 QuantifiedInterpolants, 576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1080/1080 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: 72]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_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-11-10 08:17:30,991 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