./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-75.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-75.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 70bf2e9f62afa4180b35d14c2ca8a7c4eaa8a7634655197efc7cce4c6dd1c575 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:18:49,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:18:49,167 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:18:49,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:18:49,172 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:18:49,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:18:49,195 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:18:49,196 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:18:49,196 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:18:49,199 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:18:49,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:18:49,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:18:49,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:18:49,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:18:49,201 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:18:49,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:18:49,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:18:49,202 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:18:49,202 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:18:49,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:18:49,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:18:49,203 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:18:49,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:18:49,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:18:49,203 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:18:49,203 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:18:49,204 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:18:49,204 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:18:49,205 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:18:49,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:18:49,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:18:49,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:18:49,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:18:49,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:18:49,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:18:49,206 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:18:49,206 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:18:49,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:18:49,207 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:18:49,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:18:49,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:18:49,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:18:49,208 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 -> 70bf2e9f62afa4180b35d14c2ca8a7c4eaa8a7634655197efc7cce4c6dd1c575 [2024-11-10 08:18:49,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:18:49,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:18:49,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:18:49,426 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:18:49,427 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:18:49,428 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-75.i [2024-11-10 08:18:50,644 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:18:50,785 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:18:50,786 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-75.i [2024-11-10 08:18:50,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97fe93a63/8be89a65f02748028baf36d8ff21e628/FLAG5907e9fda [2024-11-10 08:18:51,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97fe93a63/8be89a65f02748028baf36d8ff21e628 [2024-11-10 08:18:51,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:18:51,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:18:51,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:18:51,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:18:51,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:18:51,196 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:18:51" (1/1) ... [2024-11-10 08:18:51,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50d8259d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:51, skipping insertion in model container [2024-11-10 08:18:51,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:18:51" (1/1) ... [2024-11-10 08:18:51,219 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:18:51,360 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-75.i[915,928] [2024-11-10 08:18:51,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:18:51,392 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:18:51,402 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-75.i[915,928] [2024-11-10 08:18:51,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:18:51,426 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:18:51,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:51 WrapperNode [2024-11-10 08:18:51,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:18:51,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:18:51,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:18:51,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:18:51,433 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:18:51" (1/1) ... [2024-11-10 08:18:51,438 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:18:51" (1/1) ... [2024-11-10 08:18:51,452 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 73 [2024-11-10 08:18:51,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:18:51,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:18:51,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:18:51,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:18:51,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:51" (1/1) ... [2024-11-10 08:18:51,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:51" (1/1) ... [2024-11-10 08:18:51,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:51" (1/1) ... [2024-11-10 08:18:51,477 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:18:51,478 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:51" (1/1) ... [2024-11-10 08:18:51,478 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:51" (1/1) ... [2024-11-10 08:18:51,480 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:51" (1/1) ... [2024-11-10 08:18:51,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:51" (1/1) ... [2024-11-10 08:18:51,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:51" (1/1) ... [2024-11-10 08:18:51,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:51" (1/1) ... [2024-11-10 08:18:51,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:18:51,484 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:18:51,484 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:18:51,484 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:18:51,488 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:51" (1/1) ... [2024-11-10 08:18:51,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:18:51,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:18:51,517 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:18:51,519 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:18:51,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:18:51,555 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:18:51,555 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:18:51,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:18:51,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:18:51,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:18:51,606 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:18:51,608 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:18:51,738 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 08:18:51,738 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:18:51,748 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:18:51,749 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:18:51,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:18:51 BoogieIcfgContainer [2024-11-10 08:18:51,749 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:18:51,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:18:51,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:18:51,754 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:18:51,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:18:51" (1/3) ... [2024-11-10 08:18:51,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4ab009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:18:51, skipping insertion in model container [2024-11-10 08:18:51,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:51" (2/3) ... [2024-11-10 08:18:51,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4ab009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:18:51, skipping insertion in model container [2024-11-10 08:18:51,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:18:51" (3/3) ... [2024-11-10 08:18:51,756 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-75.i [2024-11-10 08:18:51,769 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:18:51,770 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:18:51,835 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:18:51,844 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;@47a64bc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:18:51,844 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:18:51,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 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:18:51,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 08:18:51,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:18:51,856 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-11-10 08:18:51,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:18:51,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:18:51,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1404539548, now seen corresponding path program 1 times [2024-11-10 08:18:51,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:18:51,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342569659] [2024-11-10 08:18:51,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:18:51,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:18:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:52,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:18:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:52,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:18:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:52,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:18:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:52,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:18:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:52,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:18:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:52,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:18:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:52,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:18:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:52,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:18:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:52,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:18:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:52,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:18:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:52,086 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:18:52,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:18:52,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342569659] [2024-11-10 08:18:52,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342569659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:18:52,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:18:52,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:18:52,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972633453] [2024-11-10 08:18:52,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:18:52,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:18:52,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:18:52,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:18:52,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:18:52,116 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 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.0) internal successors, (20), 2 states have internal predecessors, (20), 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:18:52,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:18:52,131 INFO L93 Difference]: Finished difference Result 68 states and 105 transitions. [2024-11-10 08:18:52,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:18:52,133 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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 67 [2024-11-10 08:18:52,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:18:52,138 INFO L225 Difference]: With dead ends: 68 [2024-11-10 08:18:52,139 INFO L226 Difference]: Without dead ends: 33 [2024-11-10 08:18:52,141 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:18:52,144 INFO L432 NwaCegarLoop]: 43 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, 43 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:18:52,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:18:52,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-10 08:18:52,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-10 08:18:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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:18:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-10 08:18:52,173 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 67 [2024-11-10 08:18:52,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:18:52,177 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-10 08:18:52,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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:18:52,177 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-11-10 08:18:52,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 08:18:52,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:18:52,181 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-11-10 08:18:52,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:18:52,181 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:18:52,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:18:52,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1778113028, now seen corresponding path program 1 times [2024-11-10 08:18:52,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:18:52,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360434166] [2024-11-10 08:18:52,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:18:52,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:18:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:53,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:18:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:53,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:18:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:53,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:18:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:53,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:18:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:53,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:18:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:53,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:18:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:53,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:18:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:53,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:18:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:53,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:18:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:53,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:18:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:53,593 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:18:53,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:18:53,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360434166] [2024-11-10 08:18:53,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360434166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:18:53,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:18:53,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:18:53,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471014637] [2024-11-10 08:18:53,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:18:53,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:18:53,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:18:53,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:18:53,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:18:53,599 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-11-10 08:18:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:18:53,736 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-10 08:18:53,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:18:53,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-11-10 08:18:53,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:18:53,739 INFO L225 Difference]: With dead ends: 43 [2024-11-10 08:18:53,739 INFO L226 Difference]: Without dead ends: 40 [2024-11-10 08:18:53,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:18:53,741 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:18:53,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 184 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:18:53,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-10 08:18:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2024-11-10 08:18:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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:18:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2024-11-10 08:18:53,748 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 67 [2024-11-10 08:18:53,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:18:53,750 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-11-10 08:18:53,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-11-10 08:18:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2024-11-10 08:18:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 08:18:53,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:18:53,752 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-11-10 08:18:53,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:18:53,752 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:18:53,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:18:53,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1749483877, now seen corresponding path program 1 times [2024-11-10 08:18:53,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:18:53,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895766160] [2024-11-10 08:18:53,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:18:53,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:18:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:57,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:18:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:57,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:18:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:57,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:18:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:57,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:18:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:57,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:18:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:57,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:18:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:57,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:18:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:57,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:18:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:57,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:18:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:57,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:18:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:57,942 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:18:57,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:18:57,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895766160] [2024-11-10 08:18:57,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895766160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:18:57,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:18:57,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:18:57,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540305107] [2024-11-10 08:18:57,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:18:57,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:18:57,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:18:57,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:18:57,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:18:57,945 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-11-10 08:18:58,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:18:58,260 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-11-10 08:18:58,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:18:58,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-11-10 08:18:58,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:18:58,261 INFO L225 Difference]: With dead ends: 40 [2024-11-10 08:18:58,261 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 08:18:58,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:18:58,263 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:18:58,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 174 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:18:58,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 08:18:58,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 08:18:58,264 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:18:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 08:18:58,264 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2024-11-10 08:18:58,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:18:58,264 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 08:18:58,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-11-10 08:18:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 08:18:58,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 08:18:58,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:18:58,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 08:18:58,269 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 08:18:58,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 08:18:58,286 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:18:58,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:18:58 BoogieIcfgContainer [2024-11-10 08:18:58,304 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:18:58,305 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:18:58,305 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:18:58,305 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:18:58,306 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:18:51" (3/4) ... [2024-11-10 08:18:58,307 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 08:18:58,311 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 08:18:58,315 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-10 08:18:58,315 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-10 08:18:58,316 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 08:18:58,316 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 08:18:58,384 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 08:18:58,385 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 08:18:58,385 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:18:58,385 INFO L158 Benchmark]: Toolchain (without parser) took 7196.24ms. Allocated memory was 176.2MB in the beginning and 390.1MB in the end (delta: 213.9MB). Free memory was 122.0MB in the beginning and 204.5MB in the end (delta: -82.6MB). Peak memory consumption was 132.0MB. Max. memory is 16.1GB. [2024-11-10 08:18:58,385 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 140.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:18:58,386 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.11ms. Allocated memory is still 176.2MB. Free memory was 122.0MB in the beginning and 108.7MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 08:18:58,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.93ms. Allocated memory is still 176.2MB. Free memory was 108.7MB in the beginning and 107.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:18:58,386 INFO L158 Benchmark]: Boogie Preprocessor took 29.74ms. Allocated memory is still 176.2MB. Free memory was 107.3MB in the beginning and 105.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:18:58,386 INFO L158 Benchmark]: IcfgBuilder took 265.41ms. Allocated memory is still 176.2MB. Free memory was 105.2MB in the beginning and 92.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 08:18:58,386 INFO L158 Benchmark]: TraceAbstraction took 6553.76ms. Allocated memory was 176.2MB in the beginning and 390.1MB in the end (delta: 213.9MB). Free memory was 92.0MB in the beginning and 209.7MB in the end (delta: -117.8MB). Peak memory consumption was 98.4MB. Max. memory is 16.1GB. [2024-11-10 08:18:58,387 INFO L158 Benchmark]: Witness Printer took 80.04ms. Allocated memory is still 390.1MB. Free memory was 209.7MB in the beginning and 204.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 08:18:58,388 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.15ms. Allocated memory is still 176.2MB. Free memory is still 140.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.11ms. Allocated memory is still 176.2MB. Free memory was 122.0MB in the beginning and 108.7MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.93ms. Allocated memory is still 176.2MB. Free memory was 108.7MB in the beginning and 107.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.74ms. Allocated memory is still 176.2MB. Free memory was 107.3MB in the beginning and 105.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 265.41ms. Allocated memory is still 176.2MB. Free memory was 105.2MB in the beginning and 92.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6553.76ms. Allocated memory was 176.2MB in the beginning and 390.1MB in the end (delta: 213.9MB). Free memory was 92.0MB in the beginning and 209.7MB in the end (delta: -117.8MB). Peak memory consumption was 98.4MB. Max. memory is 16.1GB. * Witness Printer took 80.04ms. Allocated memory is still 390.1MB. Free memory was 209.7MB in the beginning and 204.5MB 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, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 3, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 401 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 275 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 93 IncrementalHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 126 mSDtfsCounter, 93 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 721 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 540/540 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: 66]: 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))) && (var_1_7 == \old(var_1_7))) RESULT: Ultimate proved your program to be correct! [2024-11-10 08:18:58,420 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