./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label51.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label51.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 d1cc78894862a8232926a266f0e84c32d40ba4c1c811df274fffc61517c63c36 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:17:00,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:17:00,615 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:17:00,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:17:00,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:17:00,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:17:00,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:17:00,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:17:00,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:17:00,679 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:17:00,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:17:00,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:17:00,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:17:00,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:17:00,682 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:17:00,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:17:00,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:17:00,687 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:17:00,688 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:17:00,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:17:00,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:17:00,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:17:00,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:17:00,689 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:17:00,689 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:17:00,689 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:17:00,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:17:00,690 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:17:00,690 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:17:00,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:17:00,690 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:17:00,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:17:00,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:17:00,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:17:00,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:17:00,691 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:17:00,692 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:17:00,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:17:00,692 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:17:00,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:17:00,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:17:00,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:17:00,700 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-clean/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-clean/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 -> d1cc78894862a8232926a266f0e84c32d40ba4c1c811df274fffc61517c63c36 [2024-10-10 23:17:01,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:17:01,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:17:01,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:17:01,118 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:17:01,119 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:17:01,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label51.c [2024-10-10 23:17:02,632 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:17:02,991 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:17:02,992 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label51.c [2024-10-10 23:17:03,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a77797d20/2a421f71bca44331bfffad78060b0295/FLAG75317fa0d [2024-10-10 23:17:03,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a77797d20/2a421f71bca44331bfffad78060b0295 [2024-10-10 23:17:03,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:17:03,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:17:03,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:17:03,245 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:17:03,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:17:03,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:17:03" (1/1) ... [2024-10-10 23:17:03,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b34d96d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:03, skipping insertion in model container [2024-10-10 23:17:03,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:17:03" (1/1) ... [2024-10-10 23:17:03,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:17:03,500 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label51.c[5763,5776] [2024-10-10 23:17:03,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:17:03,630 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:17:03,653 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label51.c[5763,5776] [2024-10-10 23:17:03,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:17:03,724 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:17:03,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:03 WrapperNode [2024-10-10 23:17:03,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:17:03,726 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:17:03,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:17:03,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:17:03,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:03" (1/1) ... [2024-10-10 23:17:03,753 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:03" (1/1) ... [2024-10-10 23:17:03,802 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-10-10 23:17:03,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:17:03,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:17:03,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:17:03,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:17:03,813 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:03" (1/1) ... [2024-10-10 23:17:03,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:03" (1/1) ... [2024-10-10 23:17:03,820 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:03" (1/1) ... [2024-10-10 23:17:03,862 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:17:03,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:03" (1/1) ... [2024-10-10 23:17:03,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:03" (1/1) ... [2024-10-10 23:17:03,883 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:03" (1/1) ... [2024-10-10 23:17:03,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:03" (1/1) ... [2024-10-10 23:17:03,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:03" (1/1) ... [2024-10-10 23:17:03,907 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:03" (1/1) ... [2024-10-10 23:17:03,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:17:03,918 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:17:03,919 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:17:03,919 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:17:03,919 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:03" (1/1) ... [2024-10-10 23:17:03,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:17:03,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:17:03,951 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:17:03,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:17:03,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:17:03,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:17:03,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:17:03,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:17:04,058 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:17:04,060 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:17:04,959 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-10 23:17:04,960 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:17:05,011 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:17:05,012 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:17:05,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:17:05 BoogieIcfgContainer [2024-10-10 23:17:05,014 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:17:05,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:17:05,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:17:05,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:17:05,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:17:03" (1/3) ... [2024-10-10 23:17:05,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e5e6d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:17:05, skipping insertion in model container [2024-10-10 23:17:05,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:03" (2/3) ... [2024-10-10 23:17:05,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e5e6d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:17:05, skipping insertion in model container [2024-10-10 23:17:05,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:17:05" (3/3) ... [2024-10-10 23:17:05,023 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label51.c [2024-10-10 23:17:05,036 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:17:05,036 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:17:05,100 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:17:05,107 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;@28b0bad7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:17:05,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:17:05,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:05,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-10 23:17:05,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:05,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:17:05,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:05,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:05,124 INFO L85 PathProgramCache]: Analyzing trace with hash -209253338, now seen corresponding path program 1 times [2024-10-10 23:17:05,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:05,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124272601] [2024-10-10 23:17:05,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:05,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:05,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:05,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:05,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124272601] [2024-10-10 23:17:05,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124272601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:05,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:05,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:17:05,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269877337] [2024-10-10 23:17:05,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:05,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:17:05,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:05,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:17:05,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:17:05,327 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 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) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:05,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:05,356 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2024-10-10 23:17:05,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:17:05,359 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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) Word has length 49 [2024-10-10 23:17:05,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:05,366 INFO L225 Difference]: With dead ends: 287 [2024-10-10 23:17:05,366 INFO L226 Difference]: Without dead ends: 142 [2024-10-10 23:17:05,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:17:05,371 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:05,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:17:05,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-10 23:17:05,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-10 23:17:05,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-10 23:17:05,406 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 49 [2024-10-10 23:17:05,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:05,408 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-10 23:17:05,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-10 23:17:05,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-10 23:17:05,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:05,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:17:05,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:17:05,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:05,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:05,412 INFO L85 PathProgramCache]: Analyzing trace with hash 675861189, now seen corresponding path program 1 times [2024-10-10 23:17:05,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:05,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095871389] [2024-10-10 23:17:05,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:05,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:05,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:05,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:05,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095871389] [2024-10-10 23:17:05,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095871389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:05,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:05,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:17:05,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516289968] [2024-10-10 23:17:05,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:05,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:17:05,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:05,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:17:05,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:17:05,749 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:06,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:06,510 INFO L93 Difference]: Finished difference Result 561 states and 863 transitions. [2024-10-10 23:17:06,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:17:06,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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) Word has length 49 [2024-10-10 23:17:06,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:06,515 INFO L225 Difference]: With dead ends: 561 [2024-10-10 23:17:06,515 INFO L226 Difference]: Without dead ends: 420 [2024-10-10 23:17:06,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-10 23:17:06,517 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 418 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:06,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 14 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:17:06,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-10 23:17:06,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-10-10 23:17:06,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.3842482100238664) internal successors, (580), 419 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:06,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 580 transitions. [2024-10-10 23:17:06,537 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 580 transitions. Word has length 49 [2024-10-10 23:17:06,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:06,538 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 580 transitions. [2024-10-10 23:17:06,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:06,538 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 580 transitions. [2024-10-10 23:17:06,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-10 23:17:06,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:06,544 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:17:06,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:17:06,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:06,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:06,545 INFO L85 PathProgramCache]: Analyzing trace with hash -711375351, now seen corresponding path program 1 times [2024-10-10 23:17:06,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:06,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190050395] [2024-10-10 23:17:06,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:06,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:06,975 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:06,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:06,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190050395] [2024-10-10 23:17:06,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190050395] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:17:06,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898997546] [2024-10-10 23:17:06,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:06,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:17:06,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:17:06,978 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:17:06,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:17:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:07,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:17:07,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:17:07,134 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:07,135 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:17:07,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898997546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:07,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:17:07,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-10 23:17:07,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323189004] [2024-10-10 23:17:07,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:07,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:07,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:07,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:07,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:17:07,137 INFO L87 Difference]: Start difference. First operand 420 states and 580 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:07,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:07,562 INFO L93 Difference]: Finished difference Result 978 states and 1439 transitions. [2024-10-10 23:17:07,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:07,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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) Word has length 124 [2024-10-10 23:17:07,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:07,565 INFO L225 Difference]: With dead ends: 978 [2024-10-10 23:17:07,565 INFO L226 Difference]: Without dead ends: 698 [2024-10-10 23:17:07,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:17:07,567 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 96 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:07,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 75 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:17:07,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-10 23:17:07,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 559. [2024-10-10 23:17:07,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3691756272401434) internal successors, (764), 558 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:07,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 764 transitions. [2024-10-10 23:17:07,587 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 764 transitions. Word has length 124 [2024-10-10 23:17:07,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:07,587 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 764 transitions. [2024-10-10 23:17:07,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:07,588 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 764 transitions. [2024-10-10 23:17:07,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-10 23:17:07,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:07,593 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:17:07,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:17:07,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:17:07,798 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:07,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:07,799 INFO L85 PathProgramCache]: Analyzing trace with hash 178192108, now seen corresponding path program 1 times [2024-10-10 23:17:07,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:07,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110712209] [2024-10-10 23:17:07,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:07,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:08,028 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-10 23:17:08,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:08,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110712209] [2024-10-10 23:17:08,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110712209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:08,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:08,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:17:08,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988381624] [2024-10-10 23:17:08,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:08,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:08,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:08,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:08,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:08,032 INFO L87 Difference]: Start difference. First operand 559 states and 764 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:08,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:08,396 INFO L93 Difference]: Finished difference Result 1117 states and 1562 transitions. [2024-10-10 23:17:08,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:08,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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) Word has length 184 [2024-10-10 23:17:08,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:08,399 INFO L225 Difference]: With dead ends: 1117 [2024-10-10 23:17:08,400 INFO L226 Difference]: Without dead ends: 698 [2024-10-10 23:17:08,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:08,401 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 107 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:08,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 32 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:17:08,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-10 23:17:08,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-10-10 23:17:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.2453371592539455) internal successors, (868), 697 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 868 transitions. [2024-10-10 23:17:08,415 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 868 transitions. Word has length 184 [2024-10-10 23:17:08,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:08,416 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 868 transitions. [2024-10-10 23:17:08,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:08,416 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 868 transitions. [2024-10-10 23:17:08,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-10 23:17:08,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:08,419 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:17:08,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:17:08,419 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:08,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:08,420 INFO L85 PathProgramCache]: Analyzing trace with hash -547882709, now seen corresponding path program 1 times [2024-10-10 23:17:08,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:08,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413871501] [2024-10-10 23:17:08,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:08,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:08,541 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:08,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:08,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413871501] [2024-10-10 23:17:08,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413871501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:08,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:08,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:17:08,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500185273] [2024-10-10 23:17:08,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:08,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:08,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:08,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:08,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:08,544 INFO L87 Difference]: Start difference. First operand 698 states and 868 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:08,919 INFO L93 Difference]: Finished difference Result 1534 states and 1970 transitions. [2024-10-10 23:17:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:08,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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) Word has length 201 [2024-10-10 23:17:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:08,922 INFO L225 Difference]: With dead ends: 1534 [2024-10-10 23:17:08,922 INFO L226 Difference]: Without dead ends: 976 [2024-10-10 23:17:08,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:08,924 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 58 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:08,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 212 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:17:08,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-10 23:17:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 837. [2024-10-10 23:17:08,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.2165071770334928) internal successors, (1017), 836 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:08,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1017 transitions. [2024-10-10 23:17:08,935 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1017 transitions. Word has length 201 [2024-10-10 23:17:08,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:08,936 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1017 transitions. [2024-10-10 23:17:08,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1017 transitions. [2024-10-10 23:17:08,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-10 23:17:08,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:08,939 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:17:08,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:17:08,939 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:08,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:08,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1339930154, now seen corresponding path program 1 times [2024-10-10 23:17:08,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:08,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28604053] [2024-10-10 23:17:08,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:08,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:09,319 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:09,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:09,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28604053] [2024-10-10 23:17:09,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28604053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:09,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:09,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:17:09,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841280862] [2024-10-10 23:17:09,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:09,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:17:09,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:09,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:17:09,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:17:09,321 INFO L87 Difference]: Start difference. First operand 837 states and 1017 transitions. Second operand has 7 states, 7 states have (on average 37.285714285714285) internal successors, (261), 6 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:09,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:09,645 INFO L93 Difference]: Finished difference Result 1589 states and 1944 transitions. [2024-10-10 23:17:09,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:17:09,645 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 37.285714285714285) internal successors, (261), 6 states have internal predecessors, (261), 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) Word has length 261 [2024-10-10 23:17:09,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:09,648 INFO L225 Difference]: With dead ends: 1589 [2024-10-10 23:17:09,648 INFO L226 Difference]: Without dead ends: 837 [2024-10-10 23:17:09,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:17:09,649 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:09,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 14 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:17:09,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-10 23:17:09,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2024-10-10 23:17:09,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.2105263157894737) internal successors, (1012), 836 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:09,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1012 transitions. [2024-10-10 23:17:09,660 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1012 transitions. Word has length 261 [2024-10-10 23:17:09,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:09,660 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1012 transitions. [2024-10-10 23:17:09,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.285714285714285) internal successors, (261), 6 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:09,661 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1012 transitions. [2024-10-10 23:17:09,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-10-10 23:17:09,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:09,663 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:17:09,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:17:09,664 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:09,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:09,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1937488964, now seen corresponding path program 1 times [2024-10-10 23:17:09,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:09,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937073298] [2024-10-10 23:17:09,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:09,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 79 proven. 16 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-10 23:17:10,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:10,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937073298] [2024-10-10 23:17:10,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937073298] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:17:10,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793010825] [2024-10-10 23:17:10,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:10,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:17:10,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:17:10,171 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:17:10,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:17:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:10,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:17:10,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:17:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-10 23:17:10,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:17:10,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793010825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:10,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:17:10,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-10 23:17:10,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930369456] [2024-10-10 23:17:10,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:10,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:10,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:10,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:10,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:17:10,348 INFO L87 Difference]: Start difference. First operand 837 states and 1012 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:10,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:10,898 INFO L93 Difference]: Finished difference Result 1671 states and 2067 transitions. [2024-10-10 23:17:10,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:10,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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) Word has length 297 [2024-10-10 23:17:10,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:10,903 INFO L225 Difference]: With dead ends: 1671 [2024-10-10 23:17:10,903 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:17:10,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:17:10,905 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 92 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:10,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 219 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:17:10,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:17:10,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:17:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:17:10,910 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 297 [2024-10-10 23:17:10,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:10,910 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:17:10,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:10,911 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:17:10,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:17:10,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:17:10,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:17:11,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:17:11,117 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:17:11,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:17:11,225 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:17:11,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:17:11 BoogieIcfgContainer [2024-10-10 23:17:11,249 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:17:11,250 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:17:11,250 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:17:11,250 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:17:11,250 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:17:05" (3/4) ... [2024-10-10 23:17:11,253 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:17:11,269 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:17:11,269 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:17:11,270 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:17:11,271 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:17:11,392 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:17:11,392 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:17:11,392 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:17:11,393 INFO L158 Benchmark]: Toolchain (without parser) took 8149.65ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 112.8MB in the beginning and 119.8MB in the end (delta: -7.0MB). Peak memory consumption was 152.5MB. Max. memory is 16.1GB. [2024-10-10 23:17:11,393 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 93.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:17:11,394 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.07ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 112.6MB in the beginning and 129.5MB in the end (delta: -16.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-10 23:17:11,394 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.10ms. Allocated memory is still 184.5MB. Free memory was 129.5MB in the beginning and 121.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-10 23:17:11,394 INFO L158 Benchmark]: Boogie Preprocessor took 114.68ms. Allocated memory is still 184.5MB. Free memory was 121.1MB in the beginning and 110.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 23:17:11,394 INFO L158 Benchmark]: RCFGBuilder took 1095.32ms. Allocated memory is still 184.5MB. Free memory was 110.6MB in the beginning and 109.7MB in the end (delta: 923.1kB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2024-10-10 23:17:11,395 INFO L158 Benchmark]: TraceAbstraction took 6234.33ms. Allocated memory was 184.5MB in the beginning and 302.0MB in the end (delta: 117.4MB). Free memory was 108.7MB in the beginning and 132.4MB in the end (delta: -23.7MB). Peak memory consumption was 96.8MB. Max. memory is 16.1GB. [2024-10-10 23:17:11,395 INFO L158 Benchmark]: Witness Printer took 142.68ms. Allocated memory is still 302.0MB. Free memory was 131.3MB in the beginning and 119.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 23:17:11,396 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.14ms. Allocated memory is still 142.6MB. Free memory is still 93.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.07ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 112.6MB in the beginning and 129.5MB in the end (delta: -16.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.10ms. Allocated memory is still 184.5MB. Free memory was 129.5MB in the beginning and 121.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.68ms. Allocated memory is still 184.5MB. Free memory was 121.1MB in the beginning and 110.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1095.32ms. Allocated memory is still 184.5MB. Free memory was 110.6MB in the beginning and 109.7MB in the end (delta: 923.1kB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6234.33ms. Allocated memory was 184.5MB in the beginning and 302.0MB in the end (delta: 117.4MB). Free memory was 108.7MB in the beginning and 132.4MB in the end (delta: -23.7MB). Peak memory consumption was 96.8MB. Max. memory is 16.1GB. * Witness Printer took 142.68ms. Allocated memory is still 302.0MB. Free memory was 131.3MB in the beginning and 119.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. 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: 164]: 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 1 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 913 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 913 mSDsluCounter, 783 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 402 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2493 IncrementalHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 402 mSolverCounterUnsat, 754 mSDtfsCounter, 2493 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 450 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=837occurred in iteration=5, InterpolantAutomatonStates: 25, 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, 7 MinimizatonAttempts, 278 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1586 NumberOfCodeBlocks, 1586 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1577 ConstructedInterpolants, 0 QuantifiedInterpolants, 7204 SizeOfPredicates, 0 NumberOfNonLiveVariables, 603 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 968/993 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: 592]: Loop Invariant Derived loop invariant: ((((((a10 <= 1) && (14 == a4)) && (a12 == 0)) || ((((a19 <= 9) && (a19 != 8)) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (4 <= a10)) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:17:11,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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