./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-56.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 ea5fa9597dfb355e2134f9e9e075c4e3ca829d1649455c17a870875ad29bc269 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:43:14,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:43:14,466 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:43:14,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:43:14,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:43:14,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:43:14,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:43:14,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:43:14,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:43:14,507 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:43:14,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:43:14,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:43:14,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:43:14,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:43:14,509 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:43:14,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:43:14,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:43:14,510 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:43:14,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:43:14,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:43:14,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:43:14,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:43:14,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:43:14,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:43:14,513 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:43:14,513 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:43:14,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:43:14,514 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:43:14,515 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:43:14,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:43:14,516 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:43:14,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:43:14,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:43:14,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:43:14,517 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:43:14,517 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:43:14,517 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:43:14,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:43:14,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:43:14,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:43:14,518 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:43:14,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:43:14,518 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 -> ea5fa9597dfb355e2134f9e9e075c4e3ca829d1649455c17a870875ad29bc269 [2024-11-08 23:43:14,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:43:14,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:43:14,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:43:14,810 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:43:14,811 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:43:14,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-56.i [2024-11-08 23:43:16,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:43:16,449 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:43:16,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-56.i [2024-11-08 23:43:16,461 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97f67b4f0/8f374eb5ba4b4025baca3a504cf2bac2/FLAGbdb1958fa [2024-11-08 23:43:16,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97f67b4f0/8f374eb5ba4b4025baca3a504cf2bac2 [2024-11-08 23:43:16,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:43:16,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:43:16,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:43:16,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:43:16,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:43:16,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:43:16" (1/1) ... [2024-11-08 23:43:16,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4318c3b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:16, skipping insertion in model container [2024-11-08 23:43:16,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:43:16" (1/1) ... [2024-11-08 23:43:16,521 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:43:16,704 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-56.i[915,928] [2024-11-08 23:43:16,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:43:16,770 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:43:16,782 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-56.i[915,928] [2024-11-08 23:43:16,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:43:16,835 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:43:16,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:16 WrapperNode [2024-11-08 23:43:16,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:43:16,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:43:16,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:43:16,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:43:16,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:16" (1/1) ... [2024-11-08 23:43:16,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:16" (1/1) ... [2024-11-08 23:43:16,897 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-11-08 23:43:16,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:43:16,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:43:16,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:43:16,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:43:16,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:16" (1/1) ... [2024-11-08 23:43:16,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:16" (1/1) ... [2024-11-08 23:43:16,917 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:16" (1/1) ... [2024-11-08 23:43:16,939 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-08 23:43:16,939 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:16" (1/1) ... [2024-11-08 23:43:16,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:16" (1/1) ... [2024-11-08 23:43:16,948 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:16" (1/1) ... [2024-11-08 23:43:16,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:16" (1/1) ... [2024-11-08 23:43:16,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:16" (1/1) ... [2024-11-08 23:43:16,954 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:16" (1/1) ... [2024-11-08 23:43:16,957 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:43:16,958 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:43:16,958 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:43:16,958 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:43:16,959 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:16" (1/1) ... [2024-11-08 23:43:16,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:43:16,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:43:16,998 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-08 23:43:17,001 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-08 23:43:17,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:43:17,048 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:43:17,049 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:43:17,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:43:17,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:43:17,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:43:17,122 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:43:17,126 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:43:17,485 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-08 23:43:17,488 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:43:17,525 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:43:17,525 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:43:17,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:43:17 BoogieIcfgContainer [2024-11-08 23:43:17,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:43:17,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:43:17,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:43:17,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:43:17,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:43:16" (1/3) ... [2024-11-08 23:43:17,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5062df5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:43:17, skipping insertion in model container [2024-11-08 23:43:17,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:16" (2/3) ... [2024-11-08 23:43:17,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5062df5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:43:17, skipping insertion in model container [2024-11-08 23:43:17,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:43:17" (3/3) ... [2024-11-08 23:43:17,538 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-56.i [2024-11-08 23:43:17,555 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:43:17,555 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:43:17,609 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:43:17,614 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;@6456fbea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:43:17,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:43:17,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 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-08 23:43:17,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-08 23:43:17,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:43:17,632 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, 1, 1, 1] [2024-11-08 23:43:17,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:43:17,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:43:17,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1343942101, now seen corresponding path program 1 times [2024-11-08 23:43:17,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:43:17,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137138933] [2024-11-08 23:43:17,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:43:17,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:43:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:17,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:43:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:17,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:43:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:17,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:43:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:17,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:43:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:17,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:43:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:17,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:43:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:17,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:43:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:17,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:43:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:17,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:43:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:17,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:43:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:17,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-08 23:43:17,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:43:17,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137138933] [2024-11-08 23:43:17,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137138933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:43:17,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:43:17,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:43:17,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316977309] [2024-11-08 23:43:17,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:43:17,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:43:17,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:43:17,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:43:17,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:43:17,976 INFO L87 Difference]: Start difference. First operand has 47 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 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 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-08 23:43:17,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:43:17,994 INFO L93 Difference]: Finished difference Result 91 states and 139 transitions. [2024-11-08 23:43:17,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:43:17,997 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 72 [2024-11-08 23:43:17,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:43:18,005 INFO L225 Difference]: With dead ends: 91 [2024-11-08 23:43:18,005 INFO L226 Difference]: Without dead ends: 43 [2024-11-08 23:43:18,008 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-08 23:43:18,011 INFO L432 NwaCegarLoop]: 63 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, 63 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-08 23:43:18,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:43:18,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-08 23:43:18,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-08 23:43:18,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 23:43:18,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2024-11-08 23:43:18,051 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 72 [2024-11-08 23:43:18,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:43:18,052 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2024-11-08 23:43:18,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-08 23:43:18,055 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2024-11-08 23:43:18,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-08 23:43:18,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:43:18,058 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, 1, 1, 1] [2024-11-08 23:43:18,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:43:18,058 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:43:18,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:43:18,059 INFO L85 PathProgramCache]: Analyzing trace with hash 392955029, now seen corresponding path program 1 times [2024-11-08 23:43:18,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:43:18,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478920113] [2024-11-08 23:43:18,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:43:18,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:43:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:18,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:43:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:18,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:43:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:18,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:43:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:18,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:43:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:18,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:43:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:18,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:43:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:18,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:43:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:18,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:43:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:18,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:43:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:18,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:43:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:18,875 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-08 23:43:18,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:43:18,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478920113] [2024-11-08 23:43:18,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478920113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:43:18,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:43:18,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:43:18,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305230366] [2024-11-08 23:43:18,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:43:18,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:43:18,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:43:18,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:43:18,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:43:18,879 INFO L87 Difference]: Start difference. First operand 43 states and 59 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-08 23:43:19,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:43:19,063 INFO L93 Difference]: Finished difference Result 122 states and 170 transitions. [2024-11-08 23:43:19,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:43:19,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 72 [2024-11-08 23:43:19,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:43:19,066 INFO L225 Difference]: With dead ends: 122 [2024-11-08 23:43:19,068 INFO L226 Difference]: Without dead ends: 82 [2024-11-08 23:43:19,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:43:19,070 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 37 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:43:19,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 169 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:43:19,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-08 23:43:19,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2024-11-08 23:43:19,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 23:43:19,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 103 transitions. [2024-11-08 23:43:19,091 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 103 transitions. Word has length 72 [2024-11-08 23:43:19,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:43:19,091 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 103 transitions. [2024-11-08 23:43:19,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-08 23:43:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2024-11-08 23:43:19,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-08 23:43:19,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:43:19,094 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, 1, 1, 1] [2024-11-08 23:43:19,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:43:19,094 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:43:19,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:43:19,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1094019607, now seen corresponding path program 1 times [2024-11-08 23:43:19,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:43:19,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349712051] [2024-11-08 23:43:19,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:43:19,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:43:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:20,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:43:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:20,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:43:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:20,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:43:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:20,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:43:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:20,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:43:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:20,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:43:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:20,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:43:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:20,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:43:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:20,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:43:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:20,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:43:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:20,902 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-08 23:43:20,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:43:20,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349712051] [2024-11-08 23:43:20,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349712051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:43:20,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:43:20,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 23:43:20,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107799305] [2024-11-08 23:43:20,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:43:20,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:43:20,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:43:20,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:43:20,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:43:20,908 INFO L87 Difference]: Start difference. First operand 74 states and 103 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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-08 23:43:21,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:43:21,872 INFO L93 Difference]: Finished difference Result 111 states and 151 transitions. [2024-11-08 23:43:21,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:43:21,873 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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 72 [2024-11-08 23:43:21,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:43:21,875 INFO L225 Difference]: With dead ends: 111 [2024-11-08 23:43:21,877 INFO L226 Difference]: Without dead ends: 109 [2024-11-08 23:43:21,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:43:21,879 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 41 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 23:43:21,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 266 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 23:43:21,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-08 23:43:21,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2024-11-08 23:43:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 68 states have internal predecessors, (87), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 23:43:21,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 127 transitions. [2024-11-08 23:43:21,899 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 127 transitions. Word has length 72 [2024-11-08 23:43:21,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:43:21,899 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 127 transitions. [2024-11-08 23:43:21,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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-08 23:43:21,900 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 127 transitions. [2024-11-08 23:43:21,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-08 23:43:21,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:43:21,903 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, 1, 1, 1, 1] [2024-11-08 23:43:21,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:43:21,903 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:43:21,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:43:21,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1332604775, now seen corresponding path program 1 times [2024-11-08 23:43:21,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:43:21,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549512942] [2024-11-08 23:43:21,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:43:21,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:43:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:23,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:43:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:23,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:43:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:23,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:43:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:23,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:43:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:23,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:43:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:23,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:43:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:23,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:43:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:23,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:43:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:23,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:43:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:23,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:43:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:23,443 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-08 23:43:23,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:43:23,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549512942] [2024-11-08 23:43:23,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549512942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:43:23,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:43:23,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 23:43:23,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896045597] [2024-11-08 23:43:23,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:43:23,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:43:23,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:43:23,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:43:23,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:43:23,446 INFO L87 Difference]: Start difference. First operand 91 states and 127 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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-08 23:43:24,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:43:24,179 INFO L93 Difference]: Finished difference Result 125 states and 170 transitions. [2024-11-08 23:43:24,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:43:24,183 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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 73 [2024-11-08 23:43:24,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:43:24,185 INFO L225 Difference]: With dead ends: 125 [2024-11-08 23:43:24,185 INFO L226 Difference]: Without dead ends: 123 [2024-11-08 23:43:24,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-08 23:43:24,186 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 29 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:43:24,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 345 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 23:43:24,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-08 23:43:24,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 92. [2024-11-08 23:43:24,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 23:43:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2024-11-08 23:43:24,205 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 73 [2024-11-08 23:43:24,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:43:24,206 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2024-11-08 23:43:24,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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-08 23:43:24,206 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2024-11-08 23:43:24,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-08 23:43:24,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:43:24,207 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, 1, 1, 1, 1] [2024-11-08 23:43:24,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:43:24,207 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:43:24,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:43:24,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2012663145, now seen corresponding path program 1 times [2024-11-08 23:43:24,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:43:24,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979063420] [2024-11-08 23:43:24,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:43:24,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:43:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:43:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:43:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:43:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:43:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:43:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:43:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:43:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:43:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:43:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:43:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,806 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-08 23:43:25,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:43:25,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979063420] [2024-11-08 23:43:25,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979063420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:43:25,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:43:25,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 23:43:25,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703132663] [2024-11-08 23:43:25,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:43:25,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:43:25,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:43:25,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:43:25,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:43:25,811 INFO L87 Difference]: Start difference. First operand 92 states and 129 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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-08 23:43:26,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:43:26,502 INFO L93 Difference]: Finished difference Result 123 states and 168 transitions. [2024-11-08 23:43:26,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:43:26,502 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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 73 [2024-11-08 23:43:26,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:43:26,504 INFO L225 Difference]: With dead ends: 123 [2024-11-08 23:43:26,504 INFO L226 Difference]: Without dead ends: 121 [2024-11-08 23:43:26,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-08 23:43:26,505 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 52 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:43:26,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 253 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 23:43:26,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-08 23:43:26,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 87. [2024-11-08 23:43:26,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 23:43:26,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 122 transitions. [2024-11-08 23:43:26,519 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 122 transitions. Word has length 73 [2024-11-08 23:43:26,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:43:26,520 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 122 transitions. [2024-11-08 23:43:26,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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-08 23:43:26,523 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 122 transitions. [2024-11-08 23:43:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 23:43:26,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:43:26,525 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:43:26,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:43:26,526 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:43:26,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:43:26,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1294012177, now seen corresponding path program 1 times [2024-11-08 23:43:26,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:43:26,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63330214] [2024-11-08 23:43:26,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:43:26,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:43:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:26,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:43:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:26,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:43:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:26,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:43:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:26,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:43:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:26,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:43:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:26,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:43:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:26,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:43:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:26,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:43:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:26,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:43:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:26,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:43:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:26,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 23:43:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:26,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 23:43:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:26,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 23:43:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:26,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 23:43:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:26,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 23:43:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:26,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 23:43:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:26,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 23:43:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:26,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 23:43:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:26,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 23:43:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:26,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 23:43:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 23:43:26,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:43:26,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63330214] [2024-11-08 23:43:26,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63330214] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:43:26,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123205027] [2024-11-08 23:43:26,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:43:26,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:43:26,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:43:26,661 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:43:26,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:43:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:26,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:43:26,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:43:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-08 23:43:26,888 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:43:26,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123205027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:43:26,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 23:43:26,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-08 23:43:26,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636504326] [2024-11-08 23:43:26,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:43:26,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:43:26,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:43:26,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:43:26,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:43:26,893 INFO L87 Difference]: Start difference. First operand 87 states and 122 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 23:43:26,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:43:26,925 INFO L93 Difference]: Finished difference Result 93 states and 128 transitions. [2024-11-08 23:43:26,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:43:26,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 142 [2024-11-08 23:43:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:43:26,927 INFO L225 Difference]: With dead ends: 93 [2024-11-08 23:43:26,928 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 23:43:26,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:43:26,929 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:43:26,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 102 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:43:26,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 23:43:26,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 23:43:26,932 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-08 23:43:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 23:43:26,933 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2024-11-08 23:43:26,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:43:26,934 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 23:43:26,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 23:43:26,934 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 23:43:26,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 23:43:26,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:43:26,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 23:43:27,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 23:43:27,142 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-08 23:43:27,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 23:43:27,315 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:43:27,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:43:27 BoogieIcfgContainer [2024-11-08 23:43:27,341 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:43:27,341 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:43:27,342 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:43:27,342 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:43:27,342 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:43:17" (3/4) ... [2024-11-08 23:43:27,345 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 23:43:27,349 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-08 23:43:27,353 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-08 23:43:27,354 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 23:43:27,354 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 23:43:27,354 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 23:43:27,455 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 23:43:27,456 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 23:43:27,456 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:43:27,457 INFO L158 Benchmark]: Toolchain (without parser) took 10974.79ms. Allocated memory was 157.3MB in the beginning and 230.7MB in the end (delta: 73.4MB). Free memory was 120.5MB in the beginning and 170.5MB in the end (delta: -50.0MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2024-11-08 23:43:27,457 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:43:27,457 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.45ms. Allocated memory is still 157.3MB. Free memory was 120.5MB in the beginning and 105.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:43:27,457 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.44ms. Allocated memory is still 157.3MB. Free memory was 105.7MB in the beginning and 102.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:43:27,457 INFO L158 Benchmark]: Boogie Preprocessor took 59.05ms. Allocated memory is still 157.3MB. Free memory was 102.6MB in the beginning and 98.2MB in the end (delta: 4.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:43:27,458 INFO L158 Benchmark]: RCFGBuilder took 567.83ms. Allocated memory is still 157.3MB. Free memory was 98.2MB in the beginning and 124.5MB in the end (delta: -26.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 23:43:27,458 INFO L158 Benchmark]: TraceAbstraction took 9813.15ms. Allocated memory was 157.3MB in the beginning and 230.7MB in the end (delta: 73.4MB). Free memory was 124.5MB in the beginning and 176.8MB in the end (delta: -52.3MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2024-11-08 23:43:27,458 INFO L158 Benchmark]: Witness Printer took 114.58ms. Allocated memory is still 230.7MB. Free memory was 175.8MB in the beginning and 170.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:43:27,460 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.17ms. Allocated memory is still 117.4MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.45ms. Allocated memory is still 157.3MB. Free memory was 120.5MB in the beginning and 105.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.44ms. Allocated memory is still 157.3MB. Free memory was 105.7MB in the beginning and 102.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.05ms. Allocated memory is still 157.3MB. Free memory was 102.6MB in the beginning and 98.2MB in the end (delta: 4.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 567.83ms. Allocated memory is still 157.3MB. Free memory was 98.2MB in the beginning and 124.5MB in the end (delta: -26.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9813.15ms. Allocated memory was 157.3MB in the beginning and 230.7MB in the end (delta: 73.4MB). Free memory was 124.5MB in the beginning and 176.8MB in the end (delta: -52.3MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. * Witness Printer took 114.58ms. Allocated memory is still 230.7MB. Free memory was 175.8MB in the beginning and 170.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 6, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 1198 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 885 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 720 IncrementalHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 313 mSDtfsCounter, 720 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 353 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=4, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 91 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 646 NumberOfCodeBlocks, 646 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 639 ConstructedInterpolants, 0 QuantifiedInterpolants, 2548 SizeOfPredicates, 0 NumberOfNonLiveVariables, 325 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 2475/2476 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: 86]: Loop Invariant Derived loop invariant: ((((((var_1_1 == 1) && (last_1_var_1_1 == 1)) && (k_loop == 0)) && (var_1_11 == 0)) && (last_1_var_1_11 == 0)) || (0 < k_loop)) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((((var_1_1 == 1) && (last_1_var_1_1 == 1)) && (var_1_11 == 0)) && (last_1_var_1_11 == 0)) Ensures: (((((var_1_1 == 1) && (last_1_var_1_1 == 1)) && (var_1_11 == 0)) && (last_1_var_1_11 == 0)) && ((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (last_1_var_1_1 == \old(last_1_var_1_1))) && (last_1_var_1_11 == \old(last_1_var_1_11)))) RESULT: Ultimate proved your program to be correct! [2024-11-08 23:43:27,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE