./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-c7c6ca5-m [2024-11-08 11:09:09,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:09:09,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:09:09,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:09:09,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:09:09,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:09:09,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:09:09,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:09:09,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:09:09,109 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:09:09,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:09:09,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:09:09,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:09:09,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:09:09,111 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:09:09,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:09:09,112 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:09:09,112 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:09:09,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:09:09,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:09:09,113 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:09:09,113 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:09:09,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:09:09,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:09:09,116 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:09:09,116 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:09:09,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:09:09,116 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:09:09,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:09:09,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:09:09,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:09:09,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:09:09,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:09:09,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:09:09,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:09:09,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:09:09,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:09:09,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:09:09,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:09:09,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:09:09,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:09:09,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:09:09,120 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-08 11:09:09,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:09:09,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:09:09,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:09:09,346 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:09:09,347 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:09:09,347 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-08 11:09:10,578 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:09:10,788 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:09:10,789 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label22.c [2024-11-08 11:09:10,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee476825d/306e45c0661b41cb8411e3d68c403e69/FLAG2327ab88e [2024-11-08 11:09:10,822 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee476825d/306e45c0661b41cb8411e3d68c403e69 [2024-11-08 11:09:10,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:09:10,826 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:09:10,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:09:10,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:09:10,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:09:10,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:09:10" (1/1) ... [2024-11-08 11:09:10,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43868997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:10, skipping insertion in model container [2024-11-08 11:09:10,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:09:10" (1/1) ... [2024-11-08 11:09:10,883 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:09:11,054 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-08 11:09:11,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:09:11,200 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:09:11,215 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-08 11:09:11,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:09:11,281 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:09:11,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:11 WrapperNode [2024-11-08 11:09:11,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:09:11,282 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:09:11,283 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:09:11,283 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:09:11,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:11" (1/1) ... [2024-11-08 11:09:11,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:11" (1/1) ... [2024-11-08 11:09:11,357 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-08 11:09:11,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:09:11,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:09:11,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:09:11,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:09:11,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:11" (1/1) ... [2024-11-08 11:09:11,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:11" (1/1) ... [2024-11-08 11:09:11,373 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:11" (1/1) ... [2024-11-08 11:09:11,408 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 11:09:11,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:11" (1/1) ... [2024-11-08 11:09:11,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:11" (1/1) ... [2024-11-08 11:09:11,425 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:11" (1/1) ... [2024-11-08 11:09:11,430 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:11" (1/1) ... [2024-11-08 11:09:11,436 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:11" (1/1) ... [2024-11-08 11:09:11,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:11" (1/1) ... [2024-11-08 11:09:11,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:09:11,458 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:09:11,458 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:09:11,458 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:09:11,459 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:11" (1/1) ... [2024-11-08 11:09:11,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:09:11,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:09:11,493 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:09:11,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:09:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:09:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:09:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:09:11,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:09:11,598 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:09:11,600 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:09:12,406 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-08 11:09:12,406 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:09:12,423 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:09:12,423 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:09:12,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:09:12 BoogieIcfgContainer [2024-11-08 11:09:12,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:09:12,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:09:12,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:09:12,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:09:12,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:09:10" (1/3) ... [2024-11-08 11:09:12,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6f0ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:09:12, skipping insertion in model container [2024-11-08 11:09:12,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:11" (2/3) ... [2024-11-08 11:09:12,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6f0ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:09:12, skipping insertion in model container [2024-11-08 11:09:12,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:09:12" (3/3) ... [2024-11-08 11:09:12,431 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label22.c [2024-11-08 11:09:12,446 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:09:12,446 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:09:12,506 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:09:12,511 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;@281abf10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:09:12,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:09:12,517 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-08 11:09:12,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 11:09:12,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:12,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:12,525 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:12,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:12,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2088660649, now seen corresponding path program 1 times [2024-11-08 11:09:12,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:12,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021162463] [2024-11-08 11:09:12,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:12,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:12,841 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-08 11:09:12,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:12,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021162463] [2024-11-08 11:09:12,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021162463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:12,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:12,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:09:12,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856459182] [2024-11-08 11:09:12,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:12,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:12,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:12,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:12,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:12,914 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-08 11:09:13,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:13,618 INFO L93 Difference]: Finished difference Result 567 states and 981 transitions. [2024-11-08 11:09:13,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:13,620 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-08 11:09:13,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:13,632 INFO L225 Difference]: With dead ends: 567 [2024-11-08 11:09:13,633 INFO L226 Difference]: Without dead ends: 282 [2024-11-08 11:09:13,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:13,639 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:13,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 66 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:09:13,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-08 11:09:13,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-08 11:09:13,679 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-08 11:09:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 412 transitions. [2024-11-08 11:09:13,681 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 412 transitions. Word has length 37 [2024-11-08 11:09:13,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:13,681 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 412 transitions. [2024-11-08 11:09:13,681 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-08 11:09:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 412 transitions. [2024-11-08 11:09:13,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 11:09:13,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:13,685 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:13,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:09:13,685 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:13,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:13,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1956916710, now seen corresponding path program 1 times [2024-11-08 11:09:13,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:13,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31719639] [2024-11-08 11:09:13,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:13,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:13,823 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-08 11:09:13,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:13,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31719639] [2024-11-08 11:09:13,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31719639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:13,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:13,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:09:13,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161576067] [2024-11-08 11:09:13,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:13,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:13,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:13,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:13,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:13,827 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-08 11:09:14,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:14,232 INFO L93 Difference]: Finished difference Result 840 states and 1231 transitions. [2024-11-08 11:09:14,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:14,232 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-08 11:09:14,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:14,235 INFO L225 Difference]: With dead ends: 840 [2024-11-08 11:09:14,235 INFO L226 Difference]: Without dead ends: 560 [2024-11-08 11:09:14,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:14,237 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 76 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-08 11:09:14,237 INFO L433 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-08 11:09:14,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-08 11:09:14,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-08 11:09:14,258 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-08 11:09:14,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 731 transitions. [2024-11-08 11:09:14,259 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 731 transitions. Word has length 107 [2024-11-08 11:09:14,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:14,263 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 731 transitions. [2024-11-08 11:09:14,263 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-08 11:09:14,264 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 731 transitions. [2024-11-08 11:09:14,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 11:09:14,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:14,266 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:14,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:09:14,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:14,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:14,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1254415504, now seen corresponding path program 1 times [2024-11-08 11:09:14,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:14,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897242412] [2024-11-08 11:09:14,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:14,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:14,434 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-08 11:09:14,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:14,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897242412] [2024-11-08 11:09:14,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897242412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:14,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:14,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:09:14,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210066714] [2024-11-08 11:09:14,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:14,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:14,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:14,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:14,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:14,436 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-08 11:09:14,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:14,881 INFO L93 Difference]: Finished difference Result 1396 states and 1869 transitions. [2024-11-08 11:09:14,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:14,881 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-08 11:09:14,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:14,886 INFO L225 Difference]: With dead ends: 1396 [2024-11-08 11:09:14,886 INFO L226 Difference]: Without dead ends: 838 [2024-11-08 11:09:14,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:14,888 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 113 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:14,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 211 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:09:14,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-08 11:09:14,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-08 11:09:14,905 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-08 11:09:14,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1064 transitions. [2024-11-08 11:09:14,907 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1064 transitions. Word has length 112 [2024-11-08 11:09:14,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:14,907 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1064 transitions. [2024-11-08 11:09:14,908 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-08 11:09:14,908 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1064 transitions. [2024-11-08 11:09:14,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 11:09:14,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:14,912 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:14,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:09:14,913 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:14,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:14,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1417348248, now seen corresponding path program 1 times [2024-11-08 11:09:14,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:14,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037876363] [2024-11-08 11:09:14,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:14,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:15,127 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-08 11:09:15,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:15,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037876363] [2024-11-08 11:09:15,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037876363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:15,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:15,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:09:15,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840343122] [2024-11-08 11:09:15,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:15,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:15,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:15,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:15,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:15,131 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-08 11:09:15,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:15,485 INFO L93 Difference]: Finished difference Result 2230 states and 2778 transitions. [2024-11-08 11:09:15,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:15,485 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-08 11:09:15,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:15,489 INFO L225 Difference]: With dead ends: 2230 [2024-11-08 11:09:15,490 INFO L226 Difference]: Without dead ends: 1394 [2024-11-08 11:09:15,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:15,492 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:15,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 34 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:09:15,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-08 11:09:15,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2024-11-08 11:09:15,512 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-08 11:09:15,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1626 transitions. [2024-11-08 11:09:15,516 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1626 transitions. Word has length 128 [2024-11-08 11:09:15,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:15,517 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1626 transitions. [2024-11-08 11:09:15,517 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-08 11:09:15,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1626 transitions. [2024-11-08 11:09:15,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 11:09:15,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:15,519 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:15,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:09:15,520 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:15,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:15,521 INFO L85 PathProgramCache]: Analyzing trace with hash 895165085, now seen corresponding path program 1 times [2024-11-08 11:09:15,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:15,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399363567] [2024-11-08 11:09:15,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:15,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:15,695 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-08 11:09:15,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:15,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399363567] [2024-11-08 11:09:15,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399363567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:15,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:15,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:09:15,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608669542] [2024-11-08 11:09:15,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:15,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:15,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:15,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:15,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:15,710 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-08 11:09:16,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:16,050 INFO L93 Difference]: Finished difference Result 2925 states and 3399 transitions. [2024-11-08 11:09:16,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:16,051 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-08 11:09:16,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:16,055 INFO L225 Difference]: With dead ends: 2925 [2024-11-08 11:09:16,055 INFO L226 Difference]: Without dead ends: 1533 [2024-11-08 11:09:16,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:16,058 INFO L432 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.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:16,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 82 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:09:16,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2024-11-08 11:09:16,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1533. [2024-11-08 11:09:16,076 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-08 11:09:16,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 1770 transitions. [2024-11-08 11:09:16,079 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 1770 transitions. Word has length 129 [2024-11-08 11:09:16,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:16,080 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 1770 transitions. [2024-11-08 11:09:16,080 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-08 11:09:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1770 transitions. [2024-11-08 11:09:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 11:09:16,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:16,082 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:16,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:09:16,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:16,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:16,083 INFO L85 PathProgramCache]: Analyzing trace with hash 168544124, now seen corresponding path program 1 times [2024-11-08 11:09:16,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:16,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817240030] [2024-11-08 11:09:16,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:16,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:16,366 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-08 11:09:16,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:16,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817240030] [2024-11-08 11:09:16,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817240030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:09:16,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710013711] [2024-11-08 11:09:16,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:16,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:09:16,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:09:16,371 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:09:16,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 11:09:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:16,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:09:16,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:09:16,669 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-08 11:09:16,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:09:16,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710013711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:16,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:09:16,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-08 11:09:16,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669318561] [2024-11-08 11:09:16,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:16,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:16,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:16,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:16,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:09:16,672 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-08 11:09:17,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:17,036 INFO L93 Difference]: Finished difference Result 2091 states and 2444 transitions. [2024-11-08 11:09:17,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:17,040 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-08 11:09:17,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:17,048 INFO L225 Difference]: With dead ends: 2091 [2024-11-08 11:09:17,048 INFO L226 Difference]: Without dead ends: 2089 [2024-11-08 11:09:17,049 INFO L431 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-08 11:09:17,050 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 48 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:17,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 16 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:09:17,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2024-11-08 11:09:17,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1672. [2024-11-08 11:09:17,076 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-08 11:09:17,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1958 transitions. [2024-11-08 11:09:17,079 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1958 transitions. Word has length 167 [2024-11-08 11:09:17,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:17,080 INFO L471 AbstractCegarLoop]: Abstraction has 1672 states and 1958 transitions. [2024-11-08 11:09:17,080 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-08 11:09:17,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1958 transitions. [2024-11-08 11:09:17,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-08 11:09:17,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:17,082 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-08 11:09:17,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 11:09:17,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 11:09:17,284 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:17,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:17,284 INFO L85 PathProgramCache]: Analyzing trace with hash -949617387, now seen corresponding path program 1 times [2024-11-08 11:09:17,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:17,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002552382] [2024-11-08 11:09:17,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:17,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:17,442 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-08 11:09:17,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:17,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002552382] [2024-11-08 11:09:17,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002552382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:17,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:17,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:09:17,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005413371] [2024-11-08 11:09:17,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:17,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:17,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:17,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:17,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:17,445 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-08 11:09:17,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:17,826 INFO L93 Difference]: Finished difference Result 3620 states and 4328 transitions. [2024-11-08 11:09:17,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:17,827 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-08 11:09:17,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:17,832 INFO L225 Difference]: With dead ends: 3620 [2024-11-08 11:09:17,832 INFO L226 Difference]: Without dead ends: 2089 [2024-11-08 11:09:17,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:17,836 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 50 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-08 11:09:17,836 INFO L433 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-08 11:09:17,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2024-11-08 11:09:17,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1672. [2024-11-08 11:09:17,856 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-08 11:09:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1948 transitions. [2024-11-08 11:09:17,858 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1948 transitions. Word has length 197 [2024-11-08 11:09:17,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:17,858 INFO L471 AbstractCegarLoop]: Abstraction has 1672 states and 1948 transitions. [2024-11-08 11:09:17,859 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-08 11:09:17,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1948 transitions. [2024-11-08 11:09:17,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 11:09:17,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:17,861 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-08 11:09:17,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:09:17,862 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:17,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:17,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1189835144, now seen corresponding path program 1 times [2024-11-08 11:09:17,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:17,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951682022] [2024-11-08 11:09:17,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:17,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:18,133 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-08 11:09:18,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:18,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951682022] [2024-11-08 11:09:18,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951682022] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:09:18,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443716903] [2024-11-08 11:09:18,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:18,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:09:18,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:09:18,135 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-08 11:09:18,136 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-08 11:09:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:18,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:09:18,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:09:18,284 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-08 11:09:18,284 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:09:18,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443716903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:18,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:09:18,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 11:09:18,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831366333] [2024-11-08 11:09:18,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:18,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:18,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:18,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:18,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:09:18,286 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-08 11:09:18,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:18,645 INFO L93 Difference]: Finished difference Result 2369 states and 2770 transitions. [2024-11-08 11:09:18,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:18,646 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-08 11:09:18,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:18,651 INFO L225 Difference]: With dead ends: 2369 [2024-11-08 11:09:18,652 INFO L226 Difference]: Without dead ends: 2367 [2024-11-08 11:09:18,653 INFO L431 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-08 11:09:18,655 INFO L432 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.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:18,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 11 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:09:18,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2024-11-08 11:09:18,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 1533. [2024-11-08 11:09:18,682 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-08 11:09:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 1798 transitions. [2024-11-08 11:09:18,684 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 1798 transitions. Word has length 211 [2024-11-08 11:09:18,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:18,684 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 1798 transitions. [2024-11-08 11:09:18,684 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-08 11:09:18,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1798 transitions. [2024-11-08 11:09:18,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2024-11-08 11:09:18,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:18,688 INFO L215 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-08 11:09:18,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 11:09:18,888 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-08 11:09:18,889 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:18,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:18,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1486036807, now seen corresponding path program 1 times [2024-11-08 11:09:18,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:18,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491447357] [2024-11-08 11:09:18,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:18,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:19,296 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-08 11:09:19,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:19,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491447357] [2024-11-08 11:09:19,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491447357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:19,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:19,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 11:09:19,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708044006] [2024-11-08 11:09:19,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:19,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 11:09:19,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:19,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 11:09:19,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:09:19,300 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-08 11:09:19,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:19,808 INFO L93 Difference]: Finished difference Result 2980 states and 3505 transitions. [2024-11-08 11:09:19,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 11:09:19,808 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-08 11:09:19,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:19,812 INFO L225 Difference]: With dead ends: 2980 [2024-11-08 11:09:19,812 INFO L226 Difference]: Without dead ends: 1533 [2024-11-08 11:09:19,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:09:19,814 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:19,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 30 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:09:19,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2024-11-08 11:09:19,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1533. [2024-11-08 11:09:19,829 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-08 11:09:19,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 1792 transitions. [2024-11-08 11:09:19,832 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 1792 transitions. Word has length 300 [2024-11-08 11:09:19,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:19,832 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 1792 transitions. [2024-11-08 11:09:19,832 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-08 11:09:19,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1792 transitions. [2024-11-08 11:09:19,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-08 11:09:19,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:19,836 INFO L215 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-08 11:09:19,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:09:19,836 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:19,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:19,836 INFO L85 PathProgramCache]: Analyzing trace with hash 59015251, now seen corresponding path program 1 times [2024-11-08 11:09:19,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:19,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103645225] [2024-11-08 11:09:19,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:19,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:20,008 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-08 11:09:20,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:20,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103645225] [2024-11-08 11:09:20,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103645225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:20,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:20,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:09:20,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795165521] [2024-11-08 11:09:20,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:20,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:20,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:20,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:20,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:20,011 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-08 11:09:20,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:20,427 INFO L93 Difference]: Finished difference Result 3201 states and 3804 transitions. [2024-11-08 11:09:20,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:20,431 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-08 11:09:20,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:20,431 INFO L225 Difference]: With dead ends: 3201 [2024-11-08 11:09:20,432 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:09:20,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:20,435 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 106 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-08 11:09:20,436 INFO L433 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-08 11:09:20,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:09:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:09:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:20,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:09:20,438 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 336 [2024-11-08 11:09:20,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:20,438 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:09:20,438 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-08 11:09:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:09:20,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:09:20,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:09:20,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:09:20,445 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:20,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:09:20,638 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:09:20,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:09:20 BoogieIcfgContainer [2024-11-08 11:09:20,661 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:09:20,662 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:09:20,662 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:09:20,662 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:09:20,662 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:09:12" (3/4) ... [2024-11-08 11:09:20,664 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:09:20,677 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 11:09:20,677 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:09:20,678 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:09:20,678 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:09:20,775 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:09:20,776 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:09:20,776 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:09:20,777 INFO L158 Benchmark]: Toolchain (without parser) took 9950.60ms. Allocated memory was 142.6MB in the beginning and 358.6MB in the end (delta: 216.0MB). Free memory was 70.0MB in the beginning and 242.0MB in the end (delta: -172.0MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2024-11-08 11:09:20,777 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 142.6MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:09:20,777 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.23ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 69.8MB in the beginning and 142.0MB in the end (delta: -72.2MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2024-11-08 11:09:20,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.88ms. Allocated memory is still 186.6MB. Free memory was 142.0MB in the beginning and 133.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 11:09:20,778 INFO L158 Benchmark]: Boogie Preprocessor took 98.49ms. Allocated memory is still 186.6MB. Free memory was 133.7MB in the beginning and 124.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 11:09:20,778 INFO L158 Benchmark]: RCFGBuilder took 966.04ms. Allocated memory is still 186.6MB. Free memory was 124.1MB in the beginning and 96.9MB in the end (delta: 27.2MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-11-08 11:09:20,779 INFO L158 Benchmark]: TraceAbstraction took 8236.45ms. Allocated memory was 186.6MB in the beginning and 358.6MB in the end (delta: 172.0MB). Free memory was 96.9MB in the beginning and 253.6MB in the end (delta: -156.7MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-11-08 11:09:20,779 INFO L158 Benchmark]: Witness Printer took 114.05ms. Allocated memory is still 358.6MB. Free memory was 253.6MB in the beginning and 242.0MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 11:09:20,781 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.16ms. Allocated memory is still 142.6MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 452.23ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 69.8MB in the beginning and 142.0MB in the end (delta: -72.2MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.88ms. Allocated memory is still 186.6MB. Free memory was 142.0MB in the beginning and 133.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.49ms. Allocated memory is still 186.6MB. Free memory was 133.7MB in the beginning and 124.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 966.04ms. Allocated memory is still 186.6MB. Free memory was 124.1MB in the beginning and 96.9MB in the end (delta: 27.2MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8236.45ms. Allocated memory was 186.6MB in the beginning and 358.6MB in the end (delta: 172.0MB). Free memory was 96.9MB in the beginning and 253.6MB in the end (delta: -156.7MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Witness Printer took 114.05ms. Allocated memory is still 358.6MB. Free memory was 253.6MB in the beginning and 242.0MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 8.0s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 959 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 959 mSDsluCounter, 943 SdHoareTripleChecker+Invalid, 3.3s 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.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 1668 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s 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-08 11:09:20,807 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