./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label22.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label22.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 d1a3abd6c92a6d0d0dc43edf8f70faeb8d7cb6d143fe14753200dcbb4ae12846 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:47:16,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:47:17,047 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:47:17,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:47:17,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:47:17,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:47:17,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:47:17,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:47:17,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:47:17,085 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:47:17,085 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:47:17,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:47:17,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:47:17,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:47:17,091 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:47:17,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:47:17,092 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:47:17,092 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:47:17,092 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:47:17,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:47:17,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:47:17,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:47:17,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:47:17,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:47:17,095 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:47:17,095 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:47:17,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:47:17,096 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:47:17,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:47:17,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:47:17,097 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:47:17,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:47:17,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:47:17,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:47:17,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:47:17,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:47:17,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:47:17,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:47:17,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:47:17,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:47:17,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:47:17,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:47:17,101 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 -> d1a3abd6c92a6d0d0dc43edf8f70faeb8d7cb6d143fe14753200dcbb4ae12846 [2024-11-11 16:47:17,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:47:17,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:47:17,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:47:17,393 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:47:17,393 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:47:17,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label22.c [2024-11-11 16:47:18,851 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:47:19,112 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:47:19,113 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label22.c [2024-11-11 16:47:19,135 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4d86e88e/069e7f1ea2784500a081c21db1f1c0e0/FLAG4218be590 [2024-11-11 16:47:19,152 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4d86e88e/069e7f1ea2784500a081c21db1f1c0e0 [2024-11-11 16:47:19,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:47:19,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:47:19,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:47:19,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:47:19,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:47:19,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:47:19" (1/1) ... [2024-11-11 16:47:19,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a307e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:19, skipping insertion in model container [2024-11-11 16:47:19,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:47:19" (1/1) ... [2024-11-11 16:47:19,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:47:19,467 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label22.c[4319,4332] [2024-11-11 16:47:19,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:47:19,641 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:47:19,659 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label22.c[4319,4332] [2024-11-11 16:47:19,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:47:19,736 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:47:19,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:19 WrapperNode [2024-11-11 16:47:19,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:47:19,741 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:47:19,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:47:19,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:47:19,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:19" (1/1) ... [2024-11-11 16:47:19,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:19" (1/1) ... [2024-11-11 16:47:19,836 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-11 16:47:19,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:47:19,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:47:19,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:47:19,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:47:19,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:19" (1/1) ... [2024-11-11 16:47:19,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:19" (1/1) ... [2024-11-11 16:47:19,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:19" (1/1) ... [2024-11-11 16:47:19,911 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 16:47:19,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:19" (1/1) ... [2024-11-11 16:47:19,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:19" (1/1) ... [2024-11-11 16:47:19,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:19" (1/1) ... [2024-11-11 16:47:19,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:19" (1/1) ... [2024-11-11 16:47:19,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:19" (1/1) ... [2024-11-11 16:47:19,975 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:19" (1/1) ... [2024-11-11 16:47:19,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:47:19,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:47:19,992 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:47:19,992 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:47:19,993 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:19" (1/1) ... [2024-11-11 16:47:19,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:47:20,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:47:20,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 16:47:20,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 16:47:20,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:47:20,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:47:20,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:47:20,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:47:20,151 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:47:20,153 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:47:21,302 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-11 16:47:21,302 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:47:21,329 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:47:21,330 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:47:21,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:47:21 BoogieIcfgContainer [2024-11-11 16:47:21,330 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:47:21,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:47:21,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:47:21,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:47:21,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:47:19" (1/3) ... [2024-11-11 16:47:21,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8a8d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:47:21, skipping insertion in model container [2024-11-11 16:47:21,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:47:19" (2/3) ... [2024-11-11 16:47:21,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8a8d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:47:21, skipping insertion in model container [2024-11-11 16:47:21,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:47:21" (3/3) ... [2024-11-11 16:47:21,340 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label22.c [2024-11-11 16:47:21,357 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:47:21,358 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:47:21,428 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:47:21,434 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;@7f2ffe80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:47:21,434 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:47:21,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:21,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 16:47:21,445 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:21,445 INFO L218 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] [2024-11-11 16:47:21,446 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:21,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:21,454 INFO L85 PathProgramCache]: Analyzing trace with hash 2088660649, now seen corresponding path program 1 times [2024-11-11 16:47:21,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:21,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934450971] [2024-11-11 16:47:21,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:21,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:21,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:47:21,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:21,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934450971] [2024-11-11 16:47:21,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934450971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:21,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:21,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:47:21,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554431953] [2024-11-11 16:47:21,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:21,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:21,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:21,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:21,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:21,846 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 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 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:22,600 INFO L93 Difference]: Finished difference Result 567 states and 981 transitions. [2024-11-11 16:47:22,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:22,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 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 37 [2024-11-11 16:47:22,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:22,619 INFO L225 Difference]: With dead ends: 567 [2024-11-11 16:47:22,619 INFO L226 Difference]: Without dead ends: 282 [2024-11-11 16:47:22,623 INFO L434 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-11-11 16:47:22,628 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:22,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 66 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:47:22,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-11 16:47:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-11 16:47:22,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.4661921708185053) internal successors, (412), 281 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 412 transitions. [2024-11-11 16:47:22,695 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 412 transitions. Word has length 37 [2024-11-11 16:47:22,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:22,696 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 412 transitions. [2024-11-11 16:47:22,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:22,697 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 412 transitions. [2024-11-11 16:47:22,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-11 16:47:22,702 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:22,703 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:47:22,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:47:22,703 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:22,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:22,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1956916710, now seen corresponding path program 1 times [2024-11-11 16:47:22,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:22,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538721320] [2024-11-11 16:47:22,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:22,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:22,937 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:47:22,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:22,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538721320] [2024-11-11 16:47:22,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538721320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:22,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:22,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:47:22,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569766540] [2024-11-11 16:47:22,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:22,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:22,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:22,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:22,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:22,942 INFO L87 Difference]: Start difference. First operand 282 states and 412 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:23,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:23,399 INFO L93 Difference]: Finished difference Result 840 states and 1231 transitions. [2024-11-11 16:47:23,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:23,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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 107 [2024-11-11 16:47:23,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:23,404 INFO L225 Difference]: With dead ends: 840 [2024-11-11 16:47:23,404 INFO L226 Difference]: Without dead ends: 560 [2024-11-11 16:47:23,405 INFO L434 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-11-11 16:47:23,406 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 76 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:23,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 66 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:47:23,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-11 16:47:23,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-11 16:47:23,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3076923076923077) internal successors, (731), 559 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:23,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 731 transitions. [2024-11-11 16:47:23,453 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 731 transitions. Word has length 107 [2024-11-11 16:47:23,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:23,453 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 731 transitions. [2024-11-11 16:47:23,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:23,453 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 731 transitions. [2024-11-11 16:47:23,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 16:47:23,455 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:23,456 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:47:23,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 16:47:23,456 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:23,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:23,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1254415504, now seen corresponding path program 1 times [2024-11-11 16:47:23,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:23,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507441680] [2024-11-11 16:47:23,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:23,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:23,697 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:47:23,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:23,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507441680] [2024-11-11 16:47:23,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507441680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:23,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:23,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:47:23,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488402217] [2024-11-11 16:47:23,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:23,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:23,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:23,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:23,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:23,700 INFO L87 Difference]: Start difference. First operand 560 states and 731 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:24,212 INFO L93 Difference]: Finished difference Result 1396 states and 1869 transitions. [2024-11-11 16:47:24,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:24,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 112 [2024-11-11 16:47:24,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:24,217 INFO L225 Difference]: With dead ends: 1396 [2024-11-11 16:47:24,217 INFO L226 Difference]: Without dead ends: 838 [2024-11-11 16:47:24,219 INFO L434 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-11-11 16:47:24,220 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 113 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:24,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 211 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:47:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-11 16:47:24,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-11 16:47:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2712066905615294) internal successors, (1064), 837 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1064 transitions. [2024-11-11 16:47:24,239 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1064 transitions. Word has length 112 [2024-11-11 16:47:24,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:24,239 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1064 transitions. [2024-11-11 16:47:24,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:24,240 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1064 transitions. [2024-11-11 16:47:24,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-11 16:47:24,242 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:24,242 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:47:24,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:47:24,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:24,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:24,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1417348248, now seen corresponding path program 1 times [2024-11-11 16:47:24,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:24,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029868947] [2024-11-11 16:47:24,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:24,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:47:24,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:24,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029868947] [2024-11-11 16:47:24,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029868947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:24,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:24,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:47:24,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222897822] [2024-11-11 16:47:24,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:24,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:24,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:24,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:24,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:24,426 INFO L87 Difference]: Start difference. First operand 838 states and 1064 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:24,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:24,881 INFO L93 Difference]: Finished difference Result 2230 states and 2778 transitions. [2024-11-11 16:47:24,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:24,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 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 128 [2024-11-11 16:47:24,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:24,887 INFO L225 Difference]: With dead ends: 2230 [2024-11-11 16:47:24,888 INFO L226 Difference]: Without dead ends: 1394 [2024-11-11 16:47:24,889 INFO L434 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-11-11 16:47:24,890 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:24,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 34 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:47:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-11 16:47:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2024-11-11 16:47:24,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.167264895908112) internal successors, (1626), 1393 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:24,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1626 transitions. [2024-11-11 16:47:24,930 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1626 transitions. Word has length 128 [2024-11-11 16:47:24,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:24,931 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1626 transitions. [2024-11-11 16:47:24,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:24,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1626 transitions. [2024-11-11 16:47:24,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-11 16:47:24,934 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:24,935 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:47:24,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 16:47:24,935 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:24,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:24,937 INFO L85 PathProgramCache]: Analyzing trace with hash 895165085, now seen corresponding path program 1 times [2024-11-11 16:47:24,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:24,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530421869] [2024-11-11 16:47:24,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:24,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:47:25,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:25,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530421869] [2024-11-11 16:47:25,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530421869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:25,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:25,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:47:25,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130392463] [2024-11-11 16:47:25,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:25,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:25,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:25,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:25,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:25,211 INFO L87 Difference]: Start difference. First operand 1394 states and 1626 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:25,624 INFO L93 Difference]: Finished difference Result 2925 states and 3399 transitions. [2024-11-11 16:47:25,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:25,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2024-11-11 16:47:25,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:25,630 INFO L225 Difference]: With dead ends: 2925 [2024-11-11 16:47:25,630 INFO L226 Difference]: Without dead ends: 1533 [2024-11-11 16:47:25,632 INFO L434 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-11-11 16:47:25,633 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 49 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:25,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 82 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:47:25,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2024-11-11 16:47:25,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1533. [2024-11-11 16:47:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1532 states have (on average 1.1553524804177546) internal successors, (1770), 1532 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:25,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 1770 transitions. [2024-11-11 16:47:25,659 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 1770 transitions. Word has length 129 [2024-11-11 16:47:25,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:25,659 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 1770 transitions. [2024-11-11 16:47:25,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:25,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1770 transitions. [2024-11-11 16:47:25,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-11 16:47:25,662 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:25,662 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:47:25,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:47:25,662 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:25,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:25,663 INFO L85 PathProgramCache]: Analyzing trace with hash 168544124, now seen corresponding path program 1 times [2024-11-11 16:47:25,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:25,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841243214] [2024-11-11 16:47:25,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:25,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:26,035 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 16:47:26,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:26,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841243214] [2024-11-11 16:47:26,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841243214] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:47:26,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314138454] [2024-11-11 16:47:26,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:26,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:47:26,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:47:26,041 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:47:26,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 16:47:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:26,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:47:26,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:47:26,468 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 16:47:26,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:47:26,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314138454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:26,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:47:26,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-11 16:47:26,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255088275] [2024-11-11 16:47:26,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:26,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:26,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:26,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:26,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:47:26,474 INFO L87 Difference]: Start difference. First operand 1533 states and 1770 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:26,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:26,979 INFO L93 Difference]: Finished difference Result 2091 states and 2444 transitions. [2024-11-11 16:47:26,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:26,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 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 167 [2024-11-11 16:47:26,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:26,987 INFO L225 Difference]: With dead ends: 2091 [2024-11-11 16:47:26,988 INFO L226 Difference]: Without dead ends: 2089 [2024-11-11 16:47:26,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:47:26,992 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 48 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:26,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 16 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:47:26,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2024-11-11 16:47:27,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1672. [2024-11-11 16:47:27,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1671 states have (on average 1.1717534410532615) internal successors, (1958), 1671 states have internal predecessors, (1958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:27,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1958 transitions. [2024-11-11 16:47:27,025 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1958 transitions. Word has length 167 [2024-11-11 16:47:27,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:27,025 INFO L471 AbstractCegarLoop]: Abstraction has 1672 states and 1958 transitions. [2024-11-11 16:47:27,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:27,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1958 transitions. [2024-11-11 16:47:27,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-11 16:47:27,028 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:27,028 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 16:47:27,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 16:47:27,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-11 16:47:27,233 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:27,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:27,234 INFO L85 PathProgramCache]: Analyzing trace with hash -949617387, now seen corresponding path program 1 times [2024-11-11 16:47:27,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:27,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403216711] [2024-11-11 16:47:27,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:27,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:47:27,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:27,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403216711] [2024-11-11 16:47:27,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403216711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:27,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:27,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:47:27,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577797631] [2024-11-11 16:47:27,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:27,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:27,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:27,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:27,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:27,410 INFO L87 Difference]: Start difference. First operand 1672 states and 1958 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:27,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:27,886 INFO L93 Difference]: Finished difference Result 3620 states and 4328 transitions. [2024-11-11 16:47:27,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:27,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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-11-11 16:47:27,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:27,894 INFO L225 Difference]: With dead ends: 3620 [2024-11-11 16:47:27,894 INFO L226 Difference]: Without dead ends: 2089 [2024-11-11 16:47:27,897 INFO L434 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-11-11 16:47:27,898 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 50 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:27,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 215 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:47:27,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2024-11-11 16:47:27,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1672. [2024-11-11 16:47:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1671 states have (on average 1.165769000598444) internal successors, (1948), 1671 states have internal predecessors, (1948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:27,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1948 transitions. [2024-11-11 16:47:27,929 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1948 transitions. Word has length 197 [2024-11-11 16:47:27,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:27,930 INFO L471 AbstractCegarLoop]: Abstraction has 1672 states and 1948 transitions. [2024-11-11 16:47:27,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:27,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1948 transitions. [2024-11-11 16:47:27,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-11 16:47:27,933 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:27,933 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 16:47:27,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 16:47:27,934 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:27,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:27,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1189835144, now seen corresponding path program 1 times [2024-11-11 16:47:27,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:27,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160274322] [2024-11-11 16:47:27,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:27,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 29 proven. 40 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-11 16:47:28,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:28,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160274322] [2024-11-11 16:47:28,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160274322] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:47:28,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846932034] [2024-11-11 16:47:28,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:28,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:47:28,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:47:28,199 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:47:28,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 16:47:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:28,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:47:28,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:47:28,405 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-11 16:47:28,405 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:47:28,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846932034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:28,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:47:28,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-11 16:47:28,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522127488] [2024-11-11 16:47:28,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:28,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:28,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:28,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:28,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:47:28,407 INFO L87 Difference]: Start difference. First operand 1672 states and 1948 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:28,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:28,842 INFO L93 Difference]: Finished difference Result 2369 states and 2770 transitions. [2024-11-11 16:47:28,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:28,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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 211 [2024-11-11 16:47:28,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:28,850 INFO L225 Difference]: With dead ends: 2369 [2024-11-11 16:47:28,850 INFO L226 Difference]: Without dead ends: 2367 [2024-11-11 16:47:28,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:47:28,851 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 147 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:28,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 11 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:47:28,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2024-11-11 16:47:28,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 1533. [2024-11-11 16:47:28,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1532 states have (on average 1.1736292428198434) internal successors, (1798), 1532 states have internal predecessors, (1798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:28,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 1798 transitions. [2024-11-11 16:47:28,882 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 1798 transitions. Word has length 211 [2024-11-11 16:47:28,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:28,883 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 1798 transitions. [2024-11-11 16:47:28,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:28,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1798 transitions. [2024-11-11 16:47:28,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2024-11-11 16:47:28,887 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:28,887 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:47:28,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 16:47:29,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-11 16:47:29,089 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:29,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:29,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1486036807, now seen corresponding path program 1 times [2024-11-11 16:47:29,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:29,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042375344] [2024-11-11 16:47:29,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:29,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:29,528 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-11 16:47:29,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:29,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042375344] [2024-11-11 16:47:29,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042375344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:29,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:29,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 16:47:29,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809188744] [2024-11-11 16:47:29,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:29,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 16:47:29,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:29,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 16:47:29,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:47:29,533 INFO L87 Difference]: Start difference. First operand 1533 states and 1798 transitions. Second operand has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 6 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:30,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:30,155 INFO L93 Difference]: Finished difference Result 2980 states and 3505 transitions. [2024-11-11 16:47:30,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 16:47:30,156 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 6 states have internal predecessors, (249), 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 300 [2024-11-11 16:47:30,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:30,160 INFO L225 Difference]: With dead ends: 2980 [2024-11-11 16:47:30,160 INFO L226 Difference]: Without dead ends: 1533 [2024-11-11 16:47:30,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:47:30,163 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:30,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 30 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:47:30,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2024-11-11 16:47:30,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1533. [2024-11-11 16:47:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1532 states have (on average 1.1697127937336815) internal successors, (1792), 1532 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:30,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 1792 transitions. [2024-11-11 16:47:30,190 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 1792 transitions. Word has length 300 [2024-11-11 16:47:30,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:30,190 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 1792 transitions. [2024-11-11 16:47:30,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 6 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:30,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1792 transitions. [2024-11-11 16:47:30,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-11 16:47:30,195 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:47:30,196 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:47:30,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 16:47:30,196 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:47:30,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:47:30,197 INFO L85 PathProgramCache]: Analyzing trace with hash 59015251, now seen corresponding path program 1 times [2024-11-11 16:47:30,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:47:30,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7040502] [2024-11-11 16:47:30,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:47:30,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:47:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:47:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-11-11 16:47:30,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:47:30,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7040502] [2024-11-11 16:47:30,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7040502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:47:30,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:47:30,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:47:30,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937921172] [2024-11-11 16:47:30,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:47:30,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:47:30,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:47:30,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:47:30,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:47:30,438 INFO L87 Difference]: Start difference. First operand 1533 states and 1792 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:30,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:47:30,902 INFO L93 Difference]: Finished difference Result 3201 states and 3804 transitions. [2024-11-11 16:47:30,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:47:30,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 336 [2024-11-11 16:47:30,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:47:30,904 INFO L225 Difference]: With dead ends: 3201 [2024-11-11 16:47:30,904 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 16:47:30,908 INFO L434 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-11-11 16:47:30,909 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 106 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:47:30,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 212 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:47:30,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 16:47:30,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 16:47:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 16:47:30,912 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 336 [2024-11-11 16:47:30,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:47:30,912 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 16:47:30,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:47:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 16:47:30,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 16:47:30,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 16:47:30,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 16:47:30,920 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:47:30,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 16:47:31,166 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 16:47:31,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:47:31 BoogieIcfgContainer [2024-11-11 16:47:31,189 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 16:47:31,190 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 16:47:31,190 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 16:47:31,190 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 16:47:31,193 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:47:21" (3/4) ... [2024-11-11 16:47:31,196 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 16:47:31,211 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-11 16:47:31,212 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 16:47:31,213 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 16:47:31,214 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 16:47:31,369 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 16:47:31,369 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 16:47:31,370 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 16:47:31,370 INFO L158 Benchmark]: Toolchain (without parser) took 12214.43ms. Allocated memory was 153.1MB in the beginning and 333.4MB in the end (delta: 180.4MB). Free memory was 80.4MB in the beginning and 200.3MB in the end (delta: -119.9MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. [2024-11-11 16:47:31,370 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 153.1MB. Free memory was 108.0MB in the beginning and 107.9MB in the end (delta: 139.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:47:31,371 INFO L158 Benchmark]: CACSL2BoogieTranslator took 583.61ms. Allocated memory is still 153.1MB. Free memory was 80.2MB in the beginning and 104.0MB in the end (delta: -23.7MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-11 16:47:31,371 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.37ms. Allocated memory is still 153.1MB. Free memory was 104.0MB in the beginning and 95.6MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 16:47:31,371 INFO L158 Benchmark]: Boogie Preprocessor took 153.35ms. Allocated memory is still 153.1MB. Free memory was 95.6MB in the beginning and 85.7MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 16:47:31,372 INFO L158 Benchmark]: RCFGBuilder took 1338.59ms. Allocated memory was 153.1MB in the beginning and 224.4MB in the end (delta: 71.3MB). Free memory was 85.7MB in the beginning and 134.6MB in the end (delta: -48.9MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. [2024-11-11 16:47:31,372 INFO L158 Benchmark]: TraceAbstraction took 9856.08ms. Allocated memory was 224.4MB in the beginning and 333.4MB in the end (delta: 109.1MB). Free memory was 133.5MB in the beginning and 211.8MB in the end (delta: -78.2MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2024-11-11 16:47:31,373 INFO L158 Benchmark]: Witness Printer took 180.07ms. Allocated memory is still 333.4MB. Free memory was 211.8MB in the beginning and 200.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 16:47:31,374 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.18ms. Allocated memory is still 153.1MB. Free memory was 108.0MB in the beginning and 107.9MB in the end (delta: 139.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 583.61ms. Allocated memory is still 153.1MB. Free memory was 80.2MB in the beginning and 104.0MB in the end (delta: -23.7MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.37ms. Allocated memory is still 153.1MB. Free memory was 104.0MB in the beginning and 95.6MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 153.35ms. Allocated memory is still 153.1MB. Free memory was 95.6MB in the beginning and 85.7MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1338.59ms. Allocated memory was 153.1MB in the beginning and 224.4MB in the end (delta: 71.3MB). Free memory was 85.7MB in the beginning and 134.6MB in the end (delta: -48.9MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9856.08ms. Allocated memory was 224.4MB in the beginning and 333.4MB in the end (delta: 109.1MB). Free memory was 133.5MB in the beginning and 211.8MB in the end (delta: -78.2MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. * Witness Printer took 180.07ms. Allocated memory is still 333.4MB. Free memory was 211.8MB in the beginning and 200.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. 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: 125]: 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, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 959 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 959 mSDsluCounter, 943 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 551 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4251 IncrementalHoareTripleChecker+Invalid, 4802 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 551 mSolverCounterUnsat, 883 mSDtfsCounter, 4251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 406 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1672occurred in iteration=6, InterpolantAutomatonStates: 34, 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, 1668 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2102 NumberOfCodeBlocks, 2102 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2090 ConstructedInterpolants, 0 QuantifiedInterpolants, 6715 SizeOfPredicates, 0 NumberOfNonLiveVariables, 558 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 1223/1288 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: (((((((((a19 <= 9) && (a1 <= 23)) && (14 == a4)) && (a12 == 0)) || ((((a10 <= 0) && (14 == a4)) && (a12 == 0)) && (9 <= a19))) || ((((a19 <= 9) && (8 <= a19)) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || ((((a19 <= 9) && (a10 == 3)) && (14 == a4)) && (a12 == 0))) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-11 16:47:31,405 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