./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/Problem02_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label05.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6631d0bd13862b684e6a1ef7d33df65b972a07047361d83162cfc056e8521a6a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:16:14,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:16:14,636 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:16:14,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:16:14,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:16:14,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:16:14,658 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:16:14,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:16:14,659 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:16:14,659 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:16:14,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:16:14,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:16:14,664 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:16:14,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:16:14,665 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:16:14,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:16:14,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:16:14,665 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:16:14,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:16:14,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:16:14,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:16:14,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:16:14,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:16:14,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:16:14,669 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:16:14,669 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:16:14,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:16:14,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:16:14,670 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:16:14,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:16:14,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:16:14,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:16:14,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:16:14,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:16:14,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:16:14,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:16:14,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:16:14,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:16:14,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:16:14,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:16:14,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:16:14,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:16:14,673 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6631d0bd13862b684e6a1ef7d33df65b972a07047361d83162cfc056e8521a6a [2024-10-12 15:16:14,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:16:14,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:16:14,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:16:14,909 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:16:14,910 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:16:14,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label05.c [2024-10-12 15:16:16,174 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:16:16,438 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:16:16,439 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label05.c [2024-10-12 15:16:16,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ae54b6e/ffa4465290f94ceeafc53e7170d8a486/FLAG21438ca09 [2024-10-12 15:16:16,468 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ae54b6e/ffa4465290f94ceeafc53e7170d8a486 [2024-10-12 15:16:16,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:16:16,473 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:16:16,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:16:16,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:16:16,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:16:16,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:16:16" (1/1) ... [2024-10-12 15:16:16,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63bf5506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:16, skipping insertion in model container [2024-10-12 15:16:16,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:16:16" (1/1) ... [2024-10-12 15:16:16,524 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:16:16,824 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/Problem02_label05.c[19738,19751] [2024-10-12 15:16:16,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:16:16,858 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:16:16,920 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/Problem02_label05.c[19738,19751] [2024-10-12 15:16:16,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:16:16,942 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:16:16,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:16 WrapperNode [2024-10-12 15:16:16,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:16:16,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:16:16,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:16:16,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:16:16,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:16" (1/1) ... [2024-10-12 15:16:16,975 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:16" (1/1) ... [2024-10-12 15:16:17,017 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-10-12 15:16:17,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:16:17,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:16:17,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:16:17,024 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:16:17,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:16" (1/1) ... [2024-10-12 15:16:17,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:16" (1/1) ... [2024-10-12 15:16:17,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:16" (1/1) ... [2024-10-12 15:16:17,067 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-12 15:16:17,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:16" (1/1) ... [2024-10-12 15:16:17,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:16" (1/1) ... [2024-10-12 15:16:17,079 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:16" (1/1) ... [2024-10-12 15:16:17,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:16" (1/1) ... [2024-10-12 15:16:17,091 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:16" (1/1) ... [2024-10-12 15:16:17,100 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:16" (1/1) ... [2024-10-12 15:16:17,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:16:17,106 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:16:17,106 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:16:17,106 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:16:17,107 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:16" (1/1) ... [2024-10-12 15:16:17,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:16:17,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:16:17,149 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 15:16:17,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 15:16:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:16:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:16:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:16:17,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:16:17,246 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:16:17,248 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:16:17,992 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-12 15:16:17,992 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:16:18,080 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:16:18,084 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:16:18,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:16:18 BoogieIcfgContainer [2024-10-12 15:16:18,085 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:16:18,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:16:18,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:16:18,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:16:18,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:16:16" (1/3) ... [2024-10-12 15:16:18,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5e5203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:16:18, skipping insertion in model container [2024-10-12 15:16:18,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:16" (2/3) ... [2024-10-12 15:16:18,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5e5203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:16:18, skipping insertion in model container [2024-10-12 15:16:18,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:16:18" (3/3) ... [2024-10-12 15:16:18,095 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label05.c [2024-10-12 15:16:18,130 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:16:18,130 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:16:18,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:16:18,192 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;@203eaf69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:16:18,192 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:16:18,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 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-12 15:16:18,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-12 15:16:18,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:18,208 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] [2024-10-12 15:16:18,209 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:18,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:18,215 INFO L85 PathProgramCache]: Analyzing trace with hash 323127497, now seen corresponding path program 1 times [2024-10-12 15:16:18,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:18,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258962479] [2024-10-12 15:16:18,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:18,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:18,557 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-12 15:16:18,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:18,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258962479] [2024-10-12 15:16:18,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258962479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:18,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:18,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:16:18,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608088437] [2024-10-12 15:16:18,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:18,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:16:18,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:18,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:16:18,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:16:18,597 INFO L87 Difference]: Start difference. First operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 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 62.5) internal successors, (125), 2 states have internal predecessors, (125), 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-12 15:16:18,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:18,633 INFO L93 Difference]: Finished difference Result 329 states and 625 transitions. [2024-10-12 15:16:18,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:16:18,635 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 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 125 [2024-10-12 15:16:18,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:18,646 INFO L225 Difference]: With dead ends: 329 [2024-10-12 15:16:18,646 INFO L226 Difference]: Without dead ends: 163 [2024-10-12 15:16:18,650 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-12 15:16:18,652 INFO L432 NwaCegarLoop]: 248 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, 248 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-12 15:16:18,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:16:18,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-12 15:16:18,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-12 15:16:18,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 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-12 15:16:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 248 transitions. [2024-10-12 15:16:18,698 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 248 transitions. Word has length 125 [2024-10-12 15:16:18,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:18,700 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 248 transitions. [2024-10-12 15:16:18,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 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-12 15:16:18,701 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 248 transitions. [2024-10-12 15:16:18,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-12 15:16:18,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:18,704 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] [2024-10-12 15:16:18,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:16:18,705 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:18,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:18,705 INFO L85 PathProgramCache]: Analyzing trace with hash -585671754, now seen corresponding path program 1 times [2024-10-12 15:16:18,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:18,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394684655] [2024-10-12 15:16:18,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:18,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:18,931 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-12 15:16:18,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:18,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394684655] [2024-10-12 15:16:18,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394684655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:18,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:18,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:16:18,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665573959] [2024-10-12 15:16:18,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:18,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:18,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:18,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:18,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:18,936 INFO L87 Difference]: Start difference. First operand 163 states and 248 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 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-12 15:16:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:19,416 INFO L93 Difference]: Finished difference Result 470 states and 719 transitions. [2024-10-12 15:16:19,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:19,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 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 125 [2024-10-12 15:16:19,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:19,419 INFO L225 Difference]: With dead ends: 470 [2024-10-12 15:16:19,419 INFO L226 Difference]: Without dead ends: 308 [2024-10-12 15:16:19,419 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-12 15:16:19,424 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 24 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:19,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 116 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:16:19,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-12 15:16:19,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 306. [2024-10-12 15:16:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.3311475409836067) internal successors, (406), 305 states have internal predecessors, (406), 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-12 15:16:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 406 transitions. [2024-10-12 15:16:19,447 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 406 transitions. Word has length 125 [2024-10-12 15:16:19,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:19,447 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 406 transitions. [2024-10-12 15:16:19,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 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-12 15:16:19,448 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 406 transitions. [2024-10-12 15:16:19,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-12 15:16:19,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:19,450 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:16:19,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:16:19,452 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:19,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:19,453 INFO L85 PathProgramCache]: Analyzing trace with hash -86039633, now seen corresponding path program 1 times [2024-10-12 15:16:19,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:19,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949386375] [2024-10-12 15:16:19,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:19,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 15:16:19,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:19,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949386375] [2024-10-12 15:16:19,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949386375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:19,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:19,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:16:19,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913174270] [2024-10-12 15:16:19,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:19,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:19,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:19,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:19,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:19,666 INFO L87 Difference]: Start difference. First operand 306 states and 406 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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-12 15:16:20,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:20,061 INFO L93 Difference]: Finished difference Result 892 states and 1183 transitions. [2024-10-12 15:16:20,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:20,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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 130 [2024-10-12 15:16:20,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:20,068 INFO L225 Difference]: With dead ends: 892 [2024-10-12 15:16:20,068 INFO L226 Difference]: Without dead ends: 587 [2024-10-12 15:16:20,069 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-12 15:16:20,070 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 92 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:20,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 42 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:16:20,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-10-12 15:16:20,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 447. [2024-10-12 15:16:20,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.3923766816143497) internal successors, (621), 446 states have internal predecessors, (621), 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-12 15:16:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 621 transitions. [2024-10-12 15:16:20,084 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 621 transitions. Word has length 130 [2024-10-12 15:16:20,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:20,085 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 621 transitions. [2024-10-12 15:16:20,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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-12 15:16:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 621 transitions. [2024-10-12 15:16:20,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-12 15:16:20,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:20,087 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:16:20,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:16:20,087 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:20,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:20,092 INFO L85 PathProgramCache]: Analyzing trace with hash -154876192, now seen corresponding path program 1 times [2024-10-12 15:16:20,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:20,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224991886] [2024-10-12 15:16:20,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:20,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:16:20,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:20,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224991886] [2024-10-12 15:16:20,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224991886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:20,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:20,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:16:20,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026613753] [2024-10-12 15:16:20,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:20,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:20,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:20,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:20,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:20,230 INFO L87 Difference]: Start difference. First operand 447 states and 621 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 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-12 15:16:20,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:20,586 INFO L93 Difference]: Finished difference Result 1326 states and 1845 transitions. [2024-10-12 15:16:20,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:20,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 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-12 15:16:20,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:20,589 INFO L225 Difference]: With dead ends: 1326 [2024-10-12 15:16:20,590 INFO L226 Difference]: Without dead ends: 880 [2024-10-12 15:16:20,590 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-12 15:16:20,591 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 191 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:20,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 69 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 15:16:20,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-10-12 15:16:20,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 739. [2024-10-12 15:16:20,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 1.3360433604336044) internal successors, (986), 738 states have internal predecessors, (986), 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-12 15:16:20,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 986 transitions. [2024-10-12 15:16:20,608 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 986 transitions. Word has length 136 [2024-10-12 15:16:20,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:20,608 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 986 transitions. [2024-10-12 15:16:20,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 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-12 15:16:20,609 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 986 transitions. [2024-10-12 15:16:20,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-12 15:16:20,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:20,611 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:16:20,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:16:20,611 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:20,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:20,612 INFO L85 PathProgramCache]: Analyzing trace with hash 838209904, now seen corresponding path program 1 times [2024-10-12 15:16:20,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:20,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151891548] [2024-10-12 15:16:20,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:20,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:20,698 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:16:20,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:20,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151891548] [2024-10-12 15:16:20,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151891548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:20,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:20,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:16:20,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665655550] [2024-10-12 15:16:20,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:20,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:20,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:20,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:20,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:20,702 INFO L87 Difference]: Start difference. First operand 739 states and 986 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-12 15:16:21,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:21,036 INFO L93 Difference]: Finished difference Result 2190 states and 2928 transitions. [2024-10-12 15:16:21,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:21,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 148 [2024-10-12 15:16:21,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:21,040 INFO L225 Difference]: With dead ends: 2190 [2024-10-12 15:16:21,041 INFO L226 Difference]: Without dead ends: 1452 [2024-10-12 15:16:21,042 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-12 15:16:21,043 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 151 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:21,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 112 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 15:16:21,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2024-10-12 15:16:21,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1163. [2024-10-12 15:16:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1162 states have (on average 1.3158347676419966) internal successors, (1529), 1162 states have internal predecessors, (1529), 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-12 15:16:21,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1529 transitions. [2024-10-12 15:16:21,092 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1529 transitions. Word has length 148 [2024-10-12 15:16:21,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:21,092 INFO L471 AbstractCegarLoop]: Abstraction has 1163 states and 1529 transitions. [2024-10-12 15:16:21,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-12 15:16:21,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1529 transitions. [2024-10-12 15:16:21,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-12 15:16:21,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:21,099 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:16:21,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:16:21,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:21,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:21,100 INFO L85 PathProgramCache]: Analyzing trace with hash 2124206044, now seen corresponding path program 1 times [2024-10-12 15:16:21,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:21,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057883520] [2024-10-12 15:16:21,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:21,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:16:21,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:21,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057883520] [2024-10-12 15:16:21,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057883520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:21,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:21,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:16:21,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499509241] [2024-10-12 15:16:21,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:21,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:21,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:21,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:21,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:21,274 INFO L87 Difference]: Start difference. First operand 1163 states and 1529 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-12 15:16:21,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:21,735 INFO L93 Difference]: Finished difference Result 2889 states and 3861 transitions. [2024-10-12 15:16:21,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:21,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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 156 [2024-10-12 15:16:21,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:21,744 INFO L225 Difference]: With dead ends: 2889 [2024-10-12 15:16:21,744 INFO L226 Difference]: Without dead ends: 1727 [2024-10-12 15:16:21,747 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-12 15:16:21,749 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 137 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:21,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 238 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:16:21,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2024-10-12 15:16:21,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1727. [2024-10-12 15:16:21,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1727 states, 1726 states have (on average 1.2589803012746235) internal successors, (2173), 1726 states have internal predecessors, (2173), 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-12 15:16:21,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1727 states and 2173 transitions. [2024-10-12 15:16:21,786 INFO L78 Accepts]: Start accepts. Automaton has 1727 states and 2173 transitions. Word has length 156 [2024-10-12 15:16:21,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:21,787 INFO L471 AbstractCegarLoop]: Abstraction has 1727 states and 2173 transitions. [2024-10-12 15:16:21,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-12 15:16:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2173 transitions. [2024-10-12 15:16:21,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-12 15:16:21,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:21,791 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:16:21,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:16:21,791 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:21,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:21,792 INFO L85 PathProgramCache]: Analyzing trace with hash 833176865, now seen corresponding path program 1 times [2024-10-12 15:16:21,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:21,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871881490] [2024-10-12 15:16:21,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:21,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:21,874 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-12 15:16:21,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:21,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871881490] [2024-10-12 15:16:21,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871881490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:21,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:21,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:16:21,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774305998] [2024-10-12 15:16:21,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:21,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:21,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:21,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:21,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:21,876 INFO L87 Difference]: Start difference. First operand 1727 states and 2173 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 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-12 15:16:22,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:22,282 INFO L93 Difference]: Finished difference Result 4713 states and 5890 transitions. [2024-10-12 15:16:22,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:22,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 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 168 [2024-10-12 15:16:22,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:22,293 INFO L225 Difference]: With dead ends: 4713 [2024-10-12 15:16:22,293 INFO L226 Difference]: Without dead ends: 2987 [2024-10-12 15:16:22,296 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-12 15:16:22,298 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 179 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:22,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 77 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:16:22,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2024-10-12 15:16:22,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2987. [2024-10-12 15:16:22,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2987 states, 2986 states have (on average 1.2012726054922973) internal successors, (3587), 2986 states have internal predecessors, (3587), 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-12 15:16:22,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2987 states and 3587 transitions. [2024-10-12 15:16:22,358 INFO L78 Accepts]: Start accepts. Automaton has 2987 states and 3587 transitions. Word has length 168 [2024-10-12 15:16:22,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:22,358 INFO L471 AbstractCegarLoop]: Abstraction has 2987 states and 3587 transitions. [2024-10-12 15:16:22,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 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-12 15:16:22,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2987 states and 3587 transitions. [2024-10-12 15:16:22,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-12 15:16:22,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:22,365 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 15:16:22,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:16:22,365 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:22,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:22,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1080052150, now seen corresponding path program 1 times [2024-10-12 15:16:22,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:22,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296505113] [2024-10-12 15:16:22,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:22,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:22,498 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-12 15:16:22,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:22,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296505113] [2024-10-12 15:16:22,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296505113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:22,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:22,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:16:22,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942018611] [2024-10-12 15:16:22,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:22,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:22,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:22,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:22,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:22,501 INFO L87 Difference]: Start difference. First operand 2987 states and 3587 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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-12 15:16:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:22,954 INFO L93 Difference]: Finished difference Result 6535 states and 7785 transitions. [2024-10-12 15:16:22,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:22,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 197 [2024-10-12 15:16:22,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:22,964 INFO L225 Difference]: With dead ends: 6535 [2024-10-12 15:16:22,965 INFO L226 Difference]: Without dead ends: 2984 [2024-10-12 15:16:22,969 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-12 15:16:22,970 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 159 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:22,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 48 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:16:22,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2024-10-12 15:16:23,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2983. [2024-10-12 15:16:23,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2983 states, 2982 states have (on average 1.1210596914822266) internal successors, (3343), 2982 states have internal predecessors, (3343), 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-12 15:16:23,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 3343 transitions. [2024-10-12 15:16:23,022 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 3343 transitions. Word has length 197 [2024-10-12 15:16:23,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:23,023 INFO L471 AbstractCegarLoop]: Abstraction has 2983 states and 3343 transitions. [2024-10-12 15:16:23,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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-12 15:16:23,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 3343 transitions. [2024-10-12 15:16:23,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-12 15:16:23,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:23,030 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 15:16:23,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 15:16:23,030 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:23,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:23,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1249979008, now seen corresponding path program 1 times [2024-10-12 15:16:23,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:23,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229767831] [2024-10-12 15:16:23,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:23,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:23,127 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-12 15:16:23,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:23,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229767831] [2024-10-12 15:16:23,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229767831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:23,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:23,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:16:23,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437878853] [2024-10-12 15:16:23,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:23,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:23,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:23,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:23,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:23,130 INFO L87 Difference]: Start difference. First operand 2983 states and 3343 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-12 15:16:23,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:23,499 INFO L93 Difference]: Finished difference Result 6252 states and 6987 transitions. [2024-10-12 15:16:23,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:23,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-12 15:16:23,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:23,509 INFO L225 Difference]: With dead ends: 6252 [2024-10-12 15:16:23,509 INFO L226 Difference]: Without dead ends: 3130 [2024-10-12 15:16:23,513 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-12 15:16:23,514 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 140 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:23,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 239 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 15:16:23,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3130 states. [2024-10-12 15:16:23,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3130 to 2982. [2024-10-12 15:16:23,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2982 states, 2981 states have (on average 1.0939282120093927) internal successors, (3261), 2981 states have internal predecessors, (3261), 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-12 15:16:23,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 3261 transitions. [2024-10-12 15:16:23,578 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 3261 transitions. Word has length 201 [2024-10-12 15:16:23,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:23,579 INFO L471 AbstractCegarLoop]: Abstraction has 2982 states and 3261 transitions. [2024-10-12 15:16:23,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-12 15:16:23,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 3261 transitions. [2024-10-12 15:16:23,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-12 15:16:23,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:23,584 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, 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, 1, 1, 1, 1, 1, 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-12 15:16:23,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 15:16:23,584 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:23,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:23,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1884058015, now seen corresponding path program 1 times [2024-10-12 15:16:23,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:23,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447446334] [2024-10-12 15:16:23,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:23,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 68 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:16:23,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:23,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447446334] [2024-10-12 15:16:23,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447446334] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:16:23,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207160431] [2024-10-12 15:16:23,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:23,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:16:23,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:16:23,952 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:16:23,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 15:16:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:24,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:16:24,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:16:24,238 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-12 15:16:24,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:16:24,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207160431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:24,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:16:24,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 15:16:24,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409516998] [2024-10-12 15:16:24,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:24,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:24,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:24,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:24,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:16:24,239 INFO L87 Difference]: Start difference. First operand 2982 states and 3261 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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-12 15:16:24,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:24,563 INFO L93 Difference]: Finished difference Result 5959 states and 6518 transitions. [2024-10-12 15:16:24,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:24,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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 223 [2024-10-12 15:16:24,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:24,565 INFO L225 Difference]: With dead ends: 5959 [2024-10-12 15:16:24,565 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 15:16:24,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:16:24,569 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 44 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:24,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 52 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 15:16:24,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 15:16:24,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 15:16:24,570 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-12 15:16:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 15:16:24,571 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 223 [2024-10-12 15:16:24,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:24,571 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 15:16:24,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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-12 15:16:24,571 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 15:16:24,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 15:16:24,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:16:24,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 15:16:24,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-12 15:16:24,778 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:16:24,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 15:16:24,962 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:16:24,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:16:24 BoogieIcfgContainer [2024-10-12 15:16:24,976 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:16:24,976 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:16:24,976 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:16:24,977 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:16:24,977 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:16:18" (3/4) ... [2024-10-12 15:16:24,979 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 15:16:24,990 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 15:16:24,991 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 15:16:24,991 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 15:16:24,992 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 15:16:25,110 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:16:25,110 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 15:16:25,110 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:16:25,111 INFO L158 Benchmark]: Toolchain (without parser) took 8638.42ms. Allocated memory was 155.2MB in the beginning and 297.8MB in the end (delta: 142.6MB). Free memory was 81.4MB in the beginning and 206.8MB in the end (delta: -125.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-12 15:16:25,111 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory was 108.5MB in the beginning and 108.4MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:16:25,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.66ms. Allocated memory was 155.2MB in the beginning and 197.1MB in the end (delta: 41.9MB). Free memory was 81.1MB in the beginning and 148.6MB in the end (delta: -67.4MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-10-12 15:16:25,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.22ms. Allocated memory is still 197.1MB. Free memory was 148.6MB in the beginning and 142.3MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 15:16:25,112 INFO L158 Benchmark]: Boogie Preprocessor took 81.41ms. Allocated memory is still 197.1MB. Free memory was 142.3MB in the beginning and 137.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 15:16:25,112 INFO L158 Benchmark]: RCFGBuilder took 979.06ms. Allocated memory is still 197.1MB. Free memory was 137.0MB in the beginning and 155.4MB in the end (delta: -18.3MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. [2024-10-12 15:16:25,112 INFO L158 Benchmark]: TraceAbstraction took 6889.83ms. Allocated memory was 197.1MB in the beginning and 297.8MB in the end (delta: 100.7MB). Free memory was 154.3MB in the beginning and 219.4MB in the end (delta: -65.1MB). Peak memory consumption was 173.2MB. Max. memory is 16.1GB. [2024-10-12 15:16:25,113 INFO L158 Benchmark]: Witness Printer took 134.16ms. Allocated memory is still 297.8MB. Free memory was 219.4MB in the beginning and 206.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 15:16:25,114 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 155.2MB. Free memory was 108.5MB in the beginning and 108.4MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 469.66ms. Allocated memory was 155.2MB in the beginning and 197.1MB in the end (delta: 41.9MB). Free memory was 81.1MB in the beginning and 148.6MB in the end (delta: -67.4MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.22ms. Allocated memory is still 197.1MB. Free memory was 148.6MB in the beginning and 142.3MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.41ms. Allocated memory is still 197.1MB. Free memory was 142.3MB in the beginning and 137.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 979.06ms. Allocated memory is still 197.1MB. Free memory was 137.0MB in the beginning and 155.4MB in the end (delta: -18.3MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6889.83ms. Allocated memory was 197.1MB in the beginning and 297.8MB in the end (delta: 100.7MB). Free memory was 154.3MB in the beginning and 219.4MB in the end (delta: -65.1MB). Peak memory consumption was 173.2MB. Max. memory is 16.1GB. * Witness Printer took 134.16ms. Allocated memory is still 297.8MB. Free memory was 219.4MB in the beginning and 206.8MB 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: 560]: 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, 165 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1117 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1117 mSDsluCounter, 1241 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 600 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3217 IncrementalHoareTripleChecker+Invalid, 3817 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 600 mSolverCounterUnsat, 1107 mSDtfsCounter, 3217 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2987occurred in iteration=7, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 721 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1832 NumberOfCodeBlocks, 1832 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1821 ConstructedInterpolants, 0 QuantifiedInterpolants, 4727 SizeOfPredicates, 0 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 608/666 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: 616]: Loop Invariant Derived loop invariant: (((((((((a11 == 0) && (a19 == 1)) || ((8 <= a17) && (a28 == 10))) || ((a28 == 10) && (a11 == 0))) || (a28 <= 9)) || ((a28 == 10) && (a25 != 1))) || ((a25 != 1) && (a19 == 1))) || ((a11 == 0) && (a25 != 1))) || ((8 <= a17) && (a19 == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-12 15:16:25,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE