./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/Problem01_label16.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/Problem01_label16.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 2464e957c33404298d60b891632e9df008614058c749595a2f9c32bf73970bbc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:33:37,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:33:38,003 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:33:38,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:33:38,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:33:38,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:33:38,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:33:38,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:33:38,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:33:38,039 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:33:38,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:33:38,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:33:38,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:33:38,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:33:38,042 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:33:38,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:33:38,043 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:33:38,043 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:33:38,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:33:38,044 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:33:38,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:33:38,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:33:38,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:33:38,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:33:38,049 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:33:38,049 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:33:38,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:33:38,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:33:38,050 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:33:38,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:33:38,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:33:38,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:33:38,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:33:38,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:33:38,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:33:38,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:33:38,051 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:33:38,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:33:38,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:33:38,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:33:38,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:33:38,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:33:38,054 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 -> 2464e957c33404298d60b891632e9df008614058c749595a2f9c32bf73970bbc [2024-10-10 22:33:38,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:33:38,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:33:38,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:33:38,331 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:33:38,331 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:33:38,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label16.c [2024-10-10 22:33:39,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:33:39,963 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:33:39,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label16.c [2024-10-10 22:33:39,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1a194d8f4/e787b0fed95045d2a507434b07a26dbe/FLAGb0fac18f8 [2024-10-10 22:33:40,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1a194d8f4/e787b0fed95045d2a507434b07a26dbe [2024-10-10 22:33:40,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:33:40,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:33:40,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:33:40,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:33:40,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:33:40,016 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:33:40" (1/1) ... [2024-10-10 22:33:40,017 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65d7a05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:40, skipping insertion in model container [2024-10-10 22:33:40,017 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:33:40" (1/1) ... [2024-10-10 22:33:40,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:33:40,499 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/Problem01_label16.c[21710,21723] [2024-10-10 22:33:40,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:33:40,540 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:33:40,631 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/Problem01_label16.c[21710,21723] [2024-10-10 22:33:40,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:33:40,651 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:33:40,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:40 WrapperNode [2024-10-10 22:33:40,654 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:33:40,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:33:40,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:33:40,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:33:40,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:40" (1/1) ... [2024-10-10 22:33:40,676 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:40" (1/1) ... [2024-10-10 22:33:40,730 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2024-10-10 22:33:40,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:33:40,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:33:40,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:33:40,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:33:40,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:40" (1/1) ... [2024-10-10 22:33:40,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:40" (1/1) ... [2024-10-10 22:33:40,746 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:40" (1/1) ... [2024-10-10 22:33:40,783 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 22:33:40,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:40" (1/1) ... [2024-10-10 22:33:40,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:40" (1/1) ... [2024-10-10 22:33:40,805 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:40" (1/1) ... [2024-10-10 22:33:40,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:40" (1/1) ... [2024-10-10 22:33:40,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:40" (1/1) ... [2024-10-10 22:33:40,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:40" (1/1) ... [2024-10-10 22:33:40,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:33:40,845 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:33:40,845 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:33:40,846 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:33:40,846 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:40" (1/1) ... [2024-10-10 22:33:40,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:33:40,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:33:40,873 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 22:33:40,875 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 22:33:40,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:33:40,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:33:40,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:33:40,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:33:40,985 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:33:40,987 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:33:42,005 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-10-10 22:33:42,006 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:33:42,088 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:33:42,090 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:33:42,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:33:42 BoogieIcfgContainer [2024-10-10 22:33:42,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:33:42,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:33:42,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:33:42,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:33:42,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:33:40" (1/3) ... [2024-10-10 22:33:42,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7817b739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:33:42, skipping insertion in model container [2024-10-10 22:33:42,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:33:40" (2/3) ... [2024-10-10 22:33:42,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7817b739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:33:42, skipping insertion in model container [2024-10-10 22:33:42,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:33:42" (3/3) ... [2024-10-10 22:33:42,101 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label16.c [2024-10-10 22:33:42,118 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:33:42,118 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:33:42,193 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:33:42,201 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;@25d90b7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:33:42,202 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:33:42,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 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 22:33:42,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-10 22:33:42,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:33:42,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:33:42,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:33:42,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:33:42,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1004006647, now seen corresponding path program 1 times [2024-10-10 22:33:42,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:33:42,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630256921] [2024-10-10 22:33:42,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:33:42,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:33:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:33:42,667 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 22:33:42,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:33:42,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630256921] [2024-10-10 22:33:42,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630256921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:33:42,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:33:42,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:33:42,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192383322] [2024-10-10 22:33:42,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:33:42,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:33:42,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:33:42,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:33:42,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:33:42,707 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 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 64.5) internal successors, (129), 2 states have internal predecessors, (129), 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 22:33:42,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:33:42,752 INFO L93 Difference]: Finished difference Result 271 states and 529 transitions. [2024-10-10 22:33:42,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:33:42,755 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 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 129 [2024-10-10 22:33:42,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:33:42,766 INFO L225 Difference]: With dead ends: 271 [2024-10-10 22:33:42,766 INFO L226 Difference]: Without dead ends: 134 [2024-10-10 22:33:42,770 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 22:33:42,773 INFO L432 NwaCegarLoop]: 200 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, 200 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 22:33:42,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:33:42,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-10 22:33:42,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-10 22:33:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 133 states have internal predecessors, (200), 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 22:33:42,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions. [2024-10-10 22:33:42,812 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 129 [2024-10-10 22:33:42,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:33:42,812 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 200 transitions. [2024-10-10 22:33:42,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 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 22:33:42,813 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions. [2024-10-10 22:33:42,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-10 22:33:42,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:33:42,815 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:33:42,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:33:42,819 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:33:42,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:33:42,819 INFO L85 PathProgramCache]: Analyzing trace with hash 686024759, now seen corresponding path program 1 times [2024-10-10 22:33:42,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:33:42,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926226661] [2024-10-10 22:33:42,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:33:42,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:33:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:33:43,412 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 22:33:43,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:33:43,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926226661] [2024-10-10 22:33:43,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926226661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:33:43,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:33:43,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:33:43,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836412049] [2024-10-10 22:33:43,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:33:43,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:33:43,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:33:43,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:33:43,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:33:43,419 INFO L87 Difference]: Start difference. First operand 134 states and 200 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 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 22:33:44,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:33:44,316 INFO L93 Difference]: Finished difference Result 529 states and 795 transitions. [2024-10-10 22:33:44,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:33:44,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 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 129 [2024-10-10 22:33:44,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:33:44,323 INFO L225 Difference]: With dead ends: 529 [2024-10-10 22:33:44,323 INFO L226 Difference]: Without dead ends: 396 [2024-10-10 22:33:44,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:33:44,326 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 260 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:33:44,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 35 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:33:44,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-10 22:33:44,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-10-10 22:33:44,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.3063291139240507) internal successors, (516), 395 states have internal predecessors, (516), 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 22:33:44,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 516 transitions. [2024-10-10 22:33:44,364 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 516 transitions. Word has length 129 [2024-10-10 22:33:44,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:33:44,365 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 516 transitions. [2024-10-10 22:33:44,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 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 22:33:44,365 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 516 transitions. [2024-10-10 22:33:44,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-10 22:33:44,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:33:44,371 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:33:44,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:33:44,372 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:33:44,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:33:44,373 INFO L85 PathProgramCache]: Analyzing trace with hash -157535158, now seen corresponding path program 1 times [2024-10-10 22:33:44,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:33:44,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41369232] [2024-10-10 22:33:44,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:33:44,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:33:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:33:44,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:33:44,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:33:44,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41369232] [2024-10-10 22:33:44,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41369232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:33:44,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:33:44,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:33:44,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753049768] [2024-10-10 22:33:44,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:33:44,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:33:44,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:33:44,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:33:44,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:33:44,824 INFO L87 Difference]: Start difference. First operand 396 states and 516 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 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 22:33:45,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:33:45,422 INFO L93 Difference]: Finished difference Result 886 states and 1234 transitions. [2024-10-10 22:33:45,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:33:45,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 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 136 [2024-10-10 22:33:45,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:33:45,425 INFO L225 Difference]: With dead ends: 886 [2024-10-10 22:33:45,425 INFO L226 Difference]: Without dead ends: 527 [2024-10-10 22:33:45,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:33:45,427 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 126 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:33:45,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 80 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:33:45,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-10-10 22:33:45,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 396. [2024-10-10 22:33:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.1974683544303797) internal successors, (473), 395 states have internal predecessors, (473), 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 22:33:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 473 transitions. [2024-10-10 22:33:45,442 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 473 transitions. Word has length 136 [2024-10-10 22:33:45,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:33:45,443 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 473 transitions. [2024-10-10 22:33:45,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 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 22:33:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 473 transitions. [2024-10-10 22:33:45,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-10 22:33:45,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:33:45,445 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:33:45,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:33:45,445 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:33:45,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:33:45,446 INFO L85 PathProgramCache]: Analyzing trace with hash 294925576, now seen corresponding path program 1 times [2024-10-10 22:33:45,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:33:45,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273236714] [2024-10-10 22:33:45,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:33:45,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:33:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:33:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:33:45,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:33:45,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273236714] [2024-10-10 22:33:45,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273236714] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:33:45,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367713212] [2024-10-10 22:33:45,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:33:45,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:33:45,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:33:45,698 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 22:33:45,700 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 22:33:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:33:45,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:33:45,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:33:46,047 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:33:46,047 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:33:46,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367713212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:33:46,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:33:46,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:33:46,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465128790] [2024-10-10 22:33:46,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:33:46,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:33:46,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:33:46,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:33:46,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:33:46,050 INFO L87 Difference]: Start difference. First operand 396 states and 473 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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 22:33:46,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:33:46,429 INFO L93 Difference]: Finished difference Result 1184 states and 1416 transitions. [2024-10-10 22:33:46,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:33:46,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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 144 [2024-10-10 22:33:46,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:33:46,434 INFO L225 Difference]: With dead ends: 1184 [2024-10-10 22:33:46,434 INFO L226 Difference]: Without dead ends: 658 [2024-10-10 22:33:46,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:33:46,437 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 11 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:33:46,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 170 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:33:46,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-10-10 22:33:46,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2024-10-10 22:33:46,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 657 states have (on average 1.1552511415525115) internal successors, (759), 657 states have internal predecessors, (759), 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 22:33:46,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 759 transitions. [2024-10-10 22:33:46,468 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 759 transitions. Word has length 144 [2024-10-10 22:33:46,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:33:46,468 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 759 transitions. [2024-10-10 22:33:46,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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 22:33:46,469 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 759 transitions. [2024-10-10 22:33:46,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-10 22:33:46,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:33:46,472 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:33:46,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 22:33:46,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:33:46,673 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:33:46,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:33:46,674 INFO L85 PathProgramCache]: Analyzing trace with hash 543148770, now seen corresponding path program 1 times [2024-10-10 22:33:46,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:33:46,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80131228] [2024-10-10 22:33:46,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:33:46,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:33:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:33:46,996 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-10 22:33:46,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:33:46,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80131228] [2024-10-10 22:33:46,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80131228] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:33:46,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253481130] [2024-10-10 22:33:46,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:33:46,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:33:46,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:33:47,000 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 22:33:47,002 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 22:33:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:33:47,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:33:47,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:33:47,334 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-10 22:33:47,335 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:33:47,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253481130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:33:47,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:33:47,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:33:47,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148091824] [2024-10-10 22:33:47,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:33:47,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:33:47,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:33:47,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:33:47,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:33:47,340 INFO L87 Difference]: Start difference. First operand 658 states and 759 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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 22:33:47,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:33:47,716 INFO L93 Difference]: Finished difference Result 1575 states and 1827 transitions. [2024-10-10 22:33:47,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:33:47,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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 160 [2024-10-10 22:33:47,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:33:47,718 INFO L225 Difference]: With dead ends: 1575 [2024-10-10 22:33:47,718 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 22:33:47,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:33:47,720 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:33:47,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 9 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:33:47,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 22:33:47,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 22:33:47,721 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 22:33:47,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 22:33:47,722 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 160 [2024-10-10 22:33:47,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:33:47,722 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 22:33:47,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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 22:33:47,722 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 22:33:47,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 22:33:47,725 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:33:47,753 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 22:33:47,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:33:47,930 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-10 22:33:47,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 22:33:47,954 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:33:47,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:33:47 BoogieIcfgContainer [2024-10-10 22:33:47,973 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:33:47,973 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:33:47,973 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:33:47,974 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:33:47,974 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:33:42" (3/4) ... [2024-10-10 22:33:47,976 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 22:33:48,003 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 22:33:48,004 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 22:33:48,005 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 22:33:48,006 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 22:33:48,160 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 22:33:48,162 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 22:33:48,163 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:33:48,163 INFO L158 Benchmark]: Toolchain (without parser) took 8157.35ms. Allocated memory was 161.5MB in the beginning and 295.7MB in the end (delta: 134.2MB). Free memory was 94.2MB in the beginning and 155.9MB in the end (delta: -61.7MB). Peak memory consumption was 72.6MB. Max. memory is 16.1GB. [2024-10-10 22:33:48,164 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:33:48,164 INFO L158 Benchmark]: CACSL2BoogieTranslator took 647.41ms. Allocated memory is still 161.5MB. Free memory was 93.8MB in the beginning and 114.3MB in the end (delta: -20.5MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-10-10 22:33:48,165 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.00ms. Allocated memory is still 161.5MB. Free memory was 114.3MB in the beginning and 108.5MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-10 22:33:48,165 INFO L158 Benchmark]: Boogie Preprocessor took 113.70ms. Allocated memory is still 161.5MB. Free memory was 108.5MB in the beginning and 102.6MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-10 22:33:48,166 INFO L158 Benchmark]: RCFGBuilder took 1246.05ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 102.6MB in the beginning and 152.4MB in the end (delta: -49.8MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2024-10-10 22:33:48,166 INFO L158 Benchmark]: TraceAbstraction took 5879.77ms. Allocated memory was 195.0MB in the beginning and 295.7MB in the end (delta: 100.7MB). Free memory was 151.4MB in the beginning and 168.5MB in the end (delta: -17.1MB). Peak memory consumption was 82.5MB. Max. memory is 16.1GB. [2024-10-10 22:33:48,166 INFO L158 Benchmark]: Witness Printer took 189.22ms. Allocated memory is still 295.7MB. Free memory was 168.5MB in the beginning and 155.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 22:33:48,168 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 647.41ms. Allocated memory is still 161.5MB. Free memory was 93.8MB in the beginning and 114.3MB in the end (delta: -20.5MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.00ms. Allocated memory is still 161.5MB. Free memory was 114.3MB in the beginning and 108.5MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.70ms. Allocated memory is still 161.5MB. Free memory was 108.5MB in the beginning and 102.6MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1246.05ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 102.6MB in the beginning and 152.4MB in the end (delta: -49.8MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5879.77ms. Allocated memory was 195.0MB in the beginning and 295.7MB in the end (delta: 100.7MB). Free memory was 151.4MB in the beginning and 168.5MB in the end (delta: -17.1MB). Peak memory consumption was 82.5MB. Max. memory is 16.1GB. * Witness Printer took 189.22ms. Allocated memory is still 295.7MB. Free memory was 168.5MB in the beginning and 155.9MB in the end (delta: 12.6MB). 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: 576]: 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, 136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 409 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 409 mSDsluCounter, 494 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 336 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1732 IncrementalHoareTripleChecker+Invalid, 2068 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 336 mSolverCounterUnsat, 464 mSDtfsCounter, 1732 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 317 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=658occurred in iteration=4, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 131 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1002 NumberOfCodeBlocks, 1002 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 995 ConstructedInterpolants, 0 QuantifiedInterpolants, 5602 SizeOfPredicates, 0 NumberOfNonLiveVariables, 592 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 128/134 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: 593]: Loop Invariant Derived loop invariant: (((a8 < 14) || (a16 < 6)) || (a7 != 1)) RESULT: Ultimate proved your program to be correct! [2024-10-10 22:33:48,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE