./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label08.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label08.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 8bb11b03e1d6962fa6d12d5d93aa1dd97aef360b3e232443e9b2cf50f9d87a21 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:16:59,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:16:59,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:16:59,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:16:59,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:16:59,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:16:59,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:16:59,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:16:59,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:16:59,551 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:16:59,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:16:59,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:16:59,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:16:59,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:16:59,554 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:16:59,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:16:59,554 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:16:59,554 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:16:59,554 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:16:59,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:16:59,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:16:59,557 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:16:59,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:16:59,557 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:16:59,557 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:16:59,557 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:16:59,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:16:59,557 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:16:59,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:16:59,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:16:59,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:16:59,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:16:59,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:16:59,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:16:59,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:16:59,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:16:59,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:16:59,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:16:59,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:16:59,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:16:59,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:16:59,561 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:16:59,561 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 -> 8bb11b03e1d6962fa6d12d5d93aa1dd97aef360b3e232443e9b2cf50f9d87a21 [2024-10-12 16:16:59,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:16:59,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:16:59,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:16:59,799 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:16:59,800 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:16:59,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label08.c [2024-10-12 16:17:01,079 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:17:01,350 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:17:01,351 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label08.c [2024-10-12 16:17:01,372 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fca9e916/c5ab8caae5da4232b4052f18ca939950/FLAG4cdf2a760 [2024-10-12 16:17:01,659 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fca9e916/c5ab8caae5da4232b4052f18ca939950 [2024-10-12 16:17:01,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:17:01,662 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:17:01,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:17:01,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:17:01,669 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:17:01,670 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:17:01" (1/1) ... [2024-10-12 16:17:01,671 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408f693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:17:01, skipping insertion in model container [2024-10-12 16:17:01,671 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:17:01" (1/1) ... [2024-10-12 16:17:01,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:17:01,930 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label08.c[6299,6312] [2024-10-12 16:17:02,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:17:02,287 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:17:02,311 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label08.c[6299,6312] [2024-10-12 16:17:02,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:17:02,449 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:17:02,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:17:02 WrapperNode [2024-10-12 16:17:02,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:17:02,450 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:17:02,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:17:02,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:17:02,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:17:02" (1/1) ... [2024-10-12 16:17:02,494 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:17:02" (1/1) ... [2024-10-12 16:17:02,628 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-10-12 16:17:02,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:17:02,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:17:02,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:17:02,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:17:02,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:17:02" (1/1) ... [2024-10-12 16:17:02,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:17:02" (1/1) ... [2024-10-12 16:17:02,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:17:02" (1/1) ... [2024-10-12 16:17:02,769 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 16:17:02,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:17:02" (1/1) ... [2024-10-12 16:17:02,769 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:17:02" (1/1) ... [2024-10-12 16:17:02,847 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:17:02" (1/1) ... [2024-10-12 16:17:02,860 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:17:02" (1/1) ... [2024-10-12 16:17:02,872 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:17:02" (1/1) ... [2024-10-12 16:17:02,881 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:17:02" (1/1) ... [2024-10-12 16:17:02,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:17:02,901 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:17:02,901 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:17:02,901 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:17:02,902 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:17:02" (1/1) ... [2024-10-12 16:17:02,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:17:02,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:17:02,928 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 16:17:02,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 16:17:02,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:17:02,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:17:02,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:17:02,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:17:03,019 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:17:03,020 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:17:04,846 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-10-12 16:17:04,846 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:17:04,892 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:17:04,892 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:17:04,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:17:04 BoogieIcfgContainer [2024-10-12 16:17:04,892 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:17:04,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:17:04,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:17:04,897 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:17:04,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:17:01" (1/3) ... [2024-10-12 16:17:04,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a1b9d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:17:04, skipping insertion in model container [2024-10-12 16:17:04,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:17:02" (2/3) ... [2024-10-12 16:17:04,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a1b9d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:17:04, skipping insertion in model container [2024-10-12 16:17:04,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:17:04" (3/3) ... [2024-10-12 16:17:04,899 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label08.c [2024-10-12 16:17:04,912 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:17:04,912 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:17:04,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:17:04,970 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;@2871af24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:17:04,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:17:04,978 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:04,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 16:17:04,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:04,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:04,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:04,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:04,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1337171816, now seen corresponding path program 1 times [2024-10-12 16:17:04,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:04,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509196714] [2024-10-12 16:17:04,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:04,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:05,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:17:05,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:05,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509196714] [2024-10-12 16:17:05,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509196714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:05,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:17:05,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:17:05,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506664629] [2024-10-12 16:17:05,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:05,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:17:05,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:05,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:17:05,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:17:05,184 INFO L87 Difference]: Start difference. First operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:05,236 INFO L93 Difference]: Finished difference Result 723 states and 1375 transitions. [2024-10-12 16:17:05,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:17:05,238 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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 50 [2024-10-12 16:17:05,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:05,248 INFO L225 Difference]: With dead ends: 723 [2024-10-12 16:17:05,249 INFO L226 Difference]: Without dead ends: 360 [2024-10-12 16:17:05,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:17:05,254 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:05,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 623 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:17:05,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-12 16:17:05,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-10-12 16:17:05,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.7353760445682451) internal successors, (623), 359 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:05,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2024-10-12 16:17:05,303 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 50 [2024-10-12 16:17:05,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:05,303 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2024-10-12 16:17:05,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:05,304 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2024-10-12 16:17:05,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 16:17:05,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:05,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:05,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:17:05,305 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:05,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:05,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1689275579, now seen corresponding path program 1 times [2024-10-12 16:17:05,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:05,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597794243] [2024-10-12 16:17:05,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:05,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:05,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:17:05,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:05,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597794243] [2024-10-12 16:17:05,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597794243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:05,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:17:05,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:17:05,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011824818] [2024-10-12 16:17:05,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:05,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:05,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:05,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:05,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:05,465 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:06,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:06,864 INFO L93 Difference]: Finished difference Result 1025 states and 1788 transitions. [2024-10-12 16:17:06,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:06,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 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 50 [2024-10-12 16:17:06,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:06,868 INFO L225 Difference]: With dead ends: 1025 [2024-10-12 16:17:06,868 INFO L226 Difference]: Without dead ends: 666 [2024-10-12 16:17:06,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:06,870 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 277 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:06,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 316 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:17:06,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-10-12 16:17:06,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2024-10-12 16:17:06,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 663 states have (on average 1.4796380090497738) internal successors, (981), 663 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:06,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 981 transitions. [2024-10-12 16:17:06,905 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 981 transitions. Word has length 50 [2024-10-12 16:17:06,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:06,905 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 981 transitions. [2024-10-12 16:17:06,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:06,905 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 981 transitions. [2024-10-12 16:17:06,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-12 16:17:06,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:06,909 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:06,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:17:06,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:06,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:06,911 INFO L85 PathProgramCache]: Analyzing trace with hash -502924851, now seen corresponding path program 1 times [2024-10-12 16:17:06,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:06,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915191923] [2024-10-12 16:17:06,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:06,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:17:07,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:07,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915191923] [2024-10-12 16:17:07,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915191923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:07,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:17:07,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:17:07,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068857831] [2024-10-12 16:17:07,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:07,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:07,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:07,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:07,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:07,111 INFO L87 Difference]: Start difference. First operand 664 states and 981 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:08,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:08,618 INFO L93 Difference]: Finished difference Result 1954 states and 2893 transitions. [2024-10-12 16:17:08,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:08,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2024-10-12 16:17:08,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:08,623 INFO L225 Difference]: With dead ends: 1954 [2024-10-12 16:17:08,623 INFO L226 Difference]: Without dead ends: 1291 [2024-10-12 16:17:08,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:08,626 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 258 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:08,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 325 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:17:08,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2024-10-12 16:17:08,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1281. [2024-10-12 16:17:08,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1280 states have (on average 1.39921875) internal successors, (1791), 1280 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:08,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1791 transitions. [2024-10-12 16:17:08,660 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1791 transitions. Word has length 125 [2024-10-12 16:17:08,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:08,660 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1791 transitions. [2024-10-12 16:17:08,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:08,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1791 transitions. [2024-10-12 16:17:08,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-12 16:17:08,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:08,664 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:17:08,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:17:08,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:08,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:08,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1341948969, now seen corresponding path program 1 times [2024-10-12 16:17:08,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:08,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504698046] [2024-10-12 16:17:08,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:08,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:08,821 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:17:08,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:08,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504698046] [2024-10-12 16:17:08,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504698046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:08,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:17:08,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:17:08,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235867502] [2024-10-12 16:17:08,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:08,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:08,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:08,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:08,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:08,823 INFO L87 Difference]: Start difference. First operand 1281 states and 1791 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-10-12 16:17:10,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:10,325 INFO L93 Difference]: Finished difference Result 3763 states and 5262 transitions. [2024-10-12 16:17:10,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:10,325 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-10-12 16:17:10,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:10,332 INFO L225 Difference]: With dead ends: 3763 [2024-10-12 16:17:10,332 INFO L226 Difference]: Without dead ends: 2483 [2024-10-12 16:17:10,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:10,335 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 236 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:10,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 364 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:17:10,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2024-10-12 16:17:10,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2181. [2024-10-12 16:17:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.281651376146789) internal successors, (2794), 2180 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:10,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 2794 transitions. [2024-10-12 16:17:10,366 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 2794 transitions. Word has length 129 [2024-10-12 16:17:10,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:10,366 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 2794 transitions. [2024-10-12 16:17:10,366 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-10-12 16:17:10,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2794 transitions. [2024-10-12 16:17:10,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-12 16:17:10,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:10,379 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:10,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:17:10,379 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:10,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:10,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1176070550, now seen corresponding path program 1 times [2024-10-12 16:17:10,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:10,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822530411] [2024-10-12 16:17:10,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:10,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:10,575 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-12 16:17:10,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:10,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822530411] [2024-10-12 16:17:10,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822530411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:10,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:17:10,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:17:10,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139565538] [2024-10-12 16:17:10,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:10,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:10,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:10,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:10,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:10,578 INFO L87 Difference]: Start difference. First operand 2181 states and 2794 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:11,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:11,795 INFO L93 Difference]: Finished difference Result 6165 states and 7960 transitions. [2024-10-12 16:17:11,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:11,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2024-10-12 16:17:11,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:11,807 INFO L225 Difference]: With dead ends: 6165 [2024-10-12 16:17:11,807 INFO L226 Difference]: Without dead ends: 3985 [2024-10-12 16:17:11,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:11,813 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:11,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 337 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 16:17:11,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2024-10-12 16:17:11,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3681. [2024-10-12 16:17:11,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3680 states have (on average 1.2201086956521738) internal successors, (4490), 3680 states have internal predecessors, (4490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:11,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 4490 transitions. [2024-10-12 16:17:11,863 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 4490 transitions. Word has length 220 [2024-10-12 16:17:11,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:11,864 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 4490 transitions. [2024-10-12 16:17:11,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:11,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 4490 transitions. [2024-10-12 16:17:11,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-10-12 16:17:11,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:11,867 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:11,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:17:11,868 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:11,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:11,868 INFO L85 PathProgramCache]: Analyzing trace with hash -796085586, now seen corresponding path program 1 times [2024-10-12 16:17:11,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:11,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945578998] [2024-10-12 16:17:11,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:11,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-12 16:17:12,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:12,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945578998] [2024-10-12 16:17:12,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945578998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:12,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:17:12,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:17:12,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532294422] [2024-10-12 16:17:12,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:12,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:12,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:12,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:12,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:12,378 INFO L87 Difference]: Start difference. First operand 3681 states and 4490 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:13,374 INFO L93 Difference]: Finished difference Result 7660 states and 9290 transitions. [2024-10-12 16:17:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:13,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 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 322 [2024-10-12 16:17:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:13,384 INFO L225 Difference]: With dead ends: 7660 [2024-10-12 16:17:13,384 INFO L226 Difference]: Without dead ends: 3980 [2024-10-12 16:17:13,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:13,388 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:13,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 357 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 16:17:13,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3980 states. [2024-10-12 16:17:13,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3980 to 3980. [2024-10-12 16:17:13,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3980 states, 3979 states have (on average 1.2050766524252325) internal successors, (4795), 3979 states have internal predecessors, (4795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 4795 transitions. [2024-10-12 16:17:13,455 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 4795 transitions. Word has length 322 [2024-10-12 16:17:13,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:13,456 INFO L471 AbstractCegarLoop]: Abstraction has 3980 states and 4795 transitions. [2024-10-12 16:17:13,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:13,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 4795 transitions. [2024-10-12 16:17:13,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-10-12 16:17:13,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:13,461 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:13,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:17:13,461 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:13,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:13,462 INFO L85 PathProgramCache]: Analyzing trace with hash 964758635, now seen corresponding path program 1 times [2024-10-12 16:17:13,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:13,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692529827] [2024-10-12 16:17:13,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:13,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:13,708 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-12 16:17:13,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:13,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692529827] [2024-10-12 16:17:13,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692529827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:13,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:17:13,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:17:13,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825166106] [2024-10-12 16:17:13,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:13,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:13,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:13,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:13,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:13,710 INFO L87 Difference]: Start difference. First operand 3980 states and 4795 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:15,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:15,101 INFO L93 Difference]: Finished difference Result 8856 states and 10952 transitions. [2024-10-12 16:17:15,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:15,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 337 [2024-10-12 16:17:15,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:15,115 INFO L225 Difference]: With dead ends: 8856 [2024-10-12 16:17:15,115 INFO L226 Difference]: Without dead ends: 5176 [2024-10-12 16:17:15,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:15,119 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 263 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:15,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 320 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 16:17:15,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5176 states. [2024-10-12 16:17:15,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5176 to 3677. [2024-10-12 16:17:15,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3677 states, 3676 states have (on average 1.218171926006529) internal successors, (4478), 3676 states have internal predecessors, (4478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:15,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 4478 transitions. [2024-10-12 16:17:15,172 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 4478 transitions. Word has length 337 [2024-10-12 16:17:15,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:15,172 INFO L471 AbstractCegarLoop]: Abstraction has 3677 states and 4478 transitions. [2024-10-12 16:17:15,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 4478 transitions. [2024-10-12 16:17:15,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2024-10-12 16:17:15,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:15,178 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:15,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:17:15,178 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:15,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:15,178 INFO L85 PathProgramCache]: Analyzing trace with hash -863889188, now seen corresponding path program 1 times [2024-10-12 16:17:15,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:15,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755526640] [2024-10-12 16:17:15,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:15,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-12 16:17:15,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:15,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755526640] [2024-10-12 16:17:15,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755526640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:15,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:17:15,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:17:15,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959781516] [2024-10-12 16:17:15,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:15,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:15,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:15,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:15,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:15,407 INFO L87 Difference]: Start difference. First operand 3677 states and 4478 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:16,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:16,884 INFO L93 Difference]: Finished difference Result 9156 states and 11368 transitions. [2024-10-12 16:17:16,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:16,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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 396 [2024-10-12 16:17:16,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:16,898 INFO L225 Difference]: With dead ends: 9156 [2024-10-12 16:17:16,899 INFO L226 Difference]: Without dead ends: 5779 [2024-10-12 16:17:16,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:16,903 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 277 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:16,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 634 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:17:16,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5779 states. [2024-10-12 16:17:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5779 to 5181. [2024-10-12 16:17:16,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5181 states, 5180 states have (on average 1.1768339768339768) internal successors, (6096), 5180 states have internal predecessors, (6096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5181 states to 5181 states and 6096 transitions. [2024-10-12 16:17:16,966 INFO L78 Accepts]: Start accepts. Automaton has 5181 states and 6096 transitions. Word has length 396 [2024-10-12 16:17:16,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:16,966 INFO L471 AbstractCegarLoop]: Abstraction has 5181 states and 6096 transitions. [2024-10-12 16:17:16,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:16,967 INFO L276 IsEmpty]: Start isEmpty. Operand 5181 states and 6096 transitions. [2024-10-12 16:17:16,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2024-10-12 16:17:16,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:16,971 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:16,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:17:16,971 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:16,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:16,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2012789640, now seen corresponding path program 1 times [2024-10-12 16:17:16,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:16,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124431944] [2024-10-12 16:17:16,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:16,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:17:17,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:17,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124431944] [2024-10-12 16:17:17,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124431944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:17,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:17:17,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:17:17,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587208078] [2024-10-12 16:17:17,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:17,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:17,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:17,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:17,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:17,202 INFO L87 Difference]: Start difference. First operand 5181 states and 6096 transitions. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:18,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:18,304 INFO L93 Difference]: Finished difference Result 11867 states and 14276 transitions. [2024-10-12 16:17:18,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:18,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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 402 [2024-10-12 16:17:18,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:18,332 INFO L225 Difference]: With dead ends: 11867 [2024-10-12 16:17:18,332 INFO L226 Difference]: Without dead ends: 6986 [2024-10-12 16:17:18,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:18,339 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 248 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:18,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 600 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 16:17:18,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6986 states. [2024-10-12 16:17:18,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6986 to 6086. [2024-10-12 16:17:18,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6086 states, 6085 states have (on average 1.162859490550534) internal successors, (7076), 6085 states have internal predecessors, (7076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:18,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6086 states to 6086 states and 7076 transitions. [2024-10-12 16:17:18,415 INFO L78 Accepts]: Start accepts. Automaton has 6086 states and 7076 transitions. Word has length 402 [2024-10-12 16:17:18,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:18,415 INFO L471 AbstractCegarLoop]: Abstraction has 6086 states and 7076 transitions. [2024-10-12 16:17:18,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:18,416 INFO L276 IsEmpty]: Start isEmpty. Operand 6086 states and 7076 transitions. [2024-10-12 16:17:18,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2024-10-12 16:17:18,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:18,420 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:18,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:17:18,420 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:18,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:18,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1437825733, now seen corresponding path program 1 times [2024-10-12 16:17:18,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:18,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086026563] [2024-10-12 16:17:18,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:18,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:18,695 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-12 16:17:18,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:18,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086026563] [2024-10-12 16:17:18,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086026563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:18,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:17:18,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:17:18,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060542044] [2024-10-12 16:17:18,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:18,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:18,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:18,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:18,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:18,700 INFO L87 Difference]: Start difference. First operand 6086 states and 7076 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:19,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:19,778 INFO L93 Difference]: Finished difference Result 13666 states and 16223 transitions. [2024-10-12 16:17:19,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:19,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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 419 [2024-10-12 16:17:19,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:19,792 INFO L225 Difference]: With dead ends: 13666 [2024-10-12 16:17:19,793 INFO L226 Difference]: Without dead ends: 7880 [2024-10-12 16:17:19,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:19,800 INFO L432 NwaCegarLoop]: 577 mSDtfsCounter, 248 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:19,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 614 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 16:17:19,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7880 states. [2024-10-12 16:17:19,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7880 to 7876. [2024-10-12 16:17:19,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7876 states, 7875 states have (on average 1.1457777777777778) internal successors, (9023), 7875 states have internal predecessors, (9023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7876 states to 7876 states and 9023 transitions. [2024-10-12 16:17:19,891 INFO L78 Accepts]: Start accepts. Automaton has 7876 states and 9023 transitions. Word has length 419 [2024-10-12 16:17:19,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:19,891 INFO L471 AbstractCegarLoop]: Abstraction has 7876 states and 9023 transitions. [2024-10-12 16:17:19,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:19,892 INFO L276 IsEmpty]: Start isEmpty. Operand 7876 states and 9023 transitions. [2024-10-12 16:17:19,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2024-10-12 16:17:19,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:19,896 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:19,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 16:17:19,897 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:19,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:19,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2090914766, now seen corresponding path program 1 times [2024-10-12 16:17:19,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:19,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298962423] [2024-10-12 16:17:19,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:19,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:20,345 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 49 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:17:20,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:20,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298962423] [2024-10-12 16:17:20,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298962423] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:17:20,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738730663] [2024-10-12 16:17:20,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:20,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:17:20,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:17:20,348 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:17:20,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 16:17:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:20,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:17:20,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:17:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-12 16:17:24,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:17:24,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738730663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:24,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:17:24,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 16:17:24,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576765274] [2024-10-12 16:17:24,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:24,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:24,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:24,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:24,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:17:24,588 INFO L87 Difference]: Start difference. First operand 7876 states and 9023 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:25,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:25,779 INFO L93 Difference]: Finished difference Result 20242 states and 23285 transitions. [2024-10-12 16:17:25,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:25,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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 427 [2024-10-12 16:17:25,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:25,796 INFO L225 Difference]: With dead ends: 20242 [2024-10-12 16:17:25,797 INFO L226 Difference]: Without dead ends: 12666 [2024-10-12 16:17:25,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:17:25,805 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 330 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:25,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 176 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:17:25,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12666 states. [2024-10-12 16:17:25,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12666 to 10869. [2024-10-12 16:17:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10869 states, 10868 states have (on average 1.146945160103055) internal successors, (12465), 10868 states have internal predecessors, (12465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:25,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10869 states to 10869 states and 12465 transitions. [2024-10-12 16:17:25,982 INFO L78 Accepts]: Start accepts. Automaton has 10869 states and 12465 transitions. Word has length 427 [2024-10-12 16:17:25,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:25,983 INFO L471 AbstractCegarLoop]: Abstraction has 10869 states and 12465 transitions. [2024-10-12 16:17:25,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:25,983 INFO L276 IsEmpty]: Start isEmpty. Operand 10869 states and 12465 transitions. [2024-10-12 16:17:25,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2024-10-12 16:17:25,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:25,992 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2024-10-12 16:17:26,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 16:17:26,193 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,SelfDestructingSolverStorable10 [2024-10-12 16:17:26,193 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:26,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:26,194 INFO L85 PathProgramCache]: Analyzing trace with hash -3349954, now seen corresponding path program 1 times [2024-10-12 16:17:26,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:26,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303046182] [2024-10-12 16:17:26,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:26,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:26,609 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-10-12 16:17:26,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:26,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303046182] [2024-10-12 16:17:26,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303046182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:26,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:17:26,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:17:26,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669623892] [2024-10-12 16:17:26,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:26,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:26,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:26,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:26,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:26,611 INFO L87 Difference]: Start difference. First operand 10869 states and 12465 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:27,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:27,854 INFO L93 Difference]: Finished difference Result 26836 states and 31060 transitions. [2024-10-12 16:17:27,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:27,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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 538 [2024-10-12 16:17:27,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:27,919 INFO L225 Difference]: With dead ends: 26836 [2024-10-12 16:17:27,919 INFO L226 Difference]: Without dead ends: 16267 [2024-10-12 16:17:27,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:27,925 INFO L432 NwaCegarLoop]: 585 mSDtfsCounter, 246 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:27,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 617 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:17:27,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16267 states. [2024-10-12 16:17:28,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16267 to 15656. [2024-10-12 16:17:28,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15656 states, 15655 states have (on average 1.1357393803896518) internal successors, (17780), 15655 states have internal predecessors, (17780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15656 states to 15656 states and 17780 transitions. [2024-10-12 16:17:28,060 INFO L78 Accepts]: Start accepts. Automaton has 15656 states and 17780 transitions. Word has length 538 [2024-10-12 16:17:28,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:28,060 INFO L471 AbstractCegarLoop]: Abstraction has 15656 states and 17780 transitions. [2024-10-12 16:17:28,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:28,061 INFO L276 IsEmpty]: Start isEmpty. Operand 15656 states and 17780 transitions. [2024-10-12 16:17:28,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2024-10-12 16:17:28,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:28,068 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:28,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 16:17:28,068 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:28,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:28,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1437394971, now seen corresponding path program 1 times [2024-10-12 16:17:28,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:28,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569004144] [2024-10-12 16:17:28,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:28,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-10-12 16:17:28,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:28,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569004144] [2024-10-12 16:17:28,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569004144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:28,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:17:28,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:17:28,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962860816] [2024-10-12 16:17:28,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:28,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:28,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:28,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:28,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:28,306 INFO L87 Difference]: Start difference. First operand 15656 states and 17780 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:29,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:29,372 INFO L93 Difference]: Finished difference Result 31308 states and 35592 transitions. [2024-10-12 16:17:29,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:29,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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 551 [2024-10-12 16:17:29,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:29,392 INFO L225 Difference]: With dead ends: 31308 [2024-10-12 16:17:29,392 INFO L226 Difference]: Without dead ends: 15952 [2024-10-12 16:17:29,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:29,405 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 464 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:29,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 69 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 16:17:29,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15952 states. [2024-10-12 16:17:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15952 to 15652. [2024-10-12 16:17:29,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15652 states, 15651 states have (on average 1.13558239090154) internal successors, (17773), 15651 states have internal predecessors, (17773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:29,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15652 states to 15652 states and 17773 transitions. [2024-10-12 16:17:29,595 INFO L78 Accepts]: Start accepts. Automaton has 15652 states and 17773 transitions. Word has length 551 [2024-10-12 16:17:29,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:29,595 INFO L471 AbstractCegarLoop]: Abstraction has 15652 states and 17773 transitions. [2024-10-12 16:17:29,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:29,595 INFO L276 IsEmpty]: Start isEmpty. Operand 15652 states and 17773 transitions. [2024-10-12 16:17:29,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2024-10-12 16:17:29,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:29,601 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:29,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 16:17:29,601 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:29,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:29,602 INFO L85 PathProgramCache]: Analyzing trace with hash -514136616, now seen corresponding path program 1 times [2024-10-12 16:17:29,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:29,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168556713] [2024-10-12 16:17:29,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:29,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:29,795 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 417 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-12 16:17:29,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:29,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168556713] [2024-10-12 16:17:29,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168556713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:29,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:17:29,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:17:29,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595036394] [2024-10-12 16:17:29,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:29,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:29,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:29,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:29,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:29,797 INFO L87 Difference]: Start difference. First operand 15652 states and 17773 transitions. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:30,673 INFO L93 Difference]: Finished difference Result 32798 states and 37287 transitions. [2024-10-12 16:17:30,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:30,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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 571 [2024-10-12 16:17:30,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:30,695 INFO L225 Difference]: With dead ends: 32798 [2024-10-12 16:17:30,695 INFO L226 Difference]: Without dead ends: 17446 [2024-10-12 16:17:30,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:30,706 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 265 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:30,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 329 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 16:17:30,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17446 states. [2024-10-12 16:17:30,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17446 to 13556. [2024-10-12 16:17:30,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13556 states, 13555 states have (on average 1.1454075986720766) internal successors, (15526), 13555 states have internal predecessors, (15526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:30,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13556 states to 13556 states and 15526 transitions. [2024-10-12 16:17:30,851 INFO L78 Accepts]: Start accepts. Automaton has 13556 states and 15526 transitions. Word has length 571 [2024-10-12 16:17:30,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:30,851 INFO L471 AbstractCegarLoop]: Abstraction has 13556 states and 15526 transitions. [2024-10-12 16:17:30,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:30,851 INFO L276 IsEmpty]: Start isEmpty. Operand 13556 states and 15526 transitions. [2024-10-12 16:17:30,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2024-10-12 16:17:30,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:30,857 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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] [2024-10-12 16:17:30,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 16:17:30,858 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:30,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:30,858 INFO L85 PathProgramCache]: Analyzing trace with hash 414200724, now seen corresponding path program 1 times [2024-10-12 16:17:30,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:30,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802782159] [2024-10-12 16:17:30,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:30,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:31,334 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 565 proven. 39 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2024-10-12 16:17:31,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:31,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802782159] [2024-10-12 16:17:31,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802782159] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:17:31,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749711779] [2024-10-12 16:17:31,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:31,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:17:31,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:17:31,336 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-10-12 16:17:31,337 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-10-12 16:17:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:31,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:17:31,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:17:31,571 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-10-12 16:17:31,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:17:31,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749711779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:31,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:17:31,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 16:17:31,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447937844] [2024-10-12 16:17:31,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:31,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:31,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:31,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:31,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:17:31,572 INFO L87 Difference]: Start difference. First operand 13556 states and 15526 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:32,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:32,595 INFO L93 Difference]: Finished difference Result 29801 states and 34428 transitions. [2024-10-12 16:17:32,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:32,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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 578 [2024-10-12 16:17:32,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:32,612 INFO L225 Difference]: With dead ends: 29801 [2024-10-12 16:17:32,612 INFO L226 Difference]: Without dead ends: 16545 [2024-10-12 16:17:32,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:17:32,623 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 362 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:32,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 442 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 16:17:32,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16545 states. [2024-10-12 16:17:32,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16545 to 16545. [2024-10-12 16:17:32,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16545 states, 16544 states have (on average 1.1320720502901354) internal successors, (18729), 16544 states have internal predecessors, (18729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16545 states to 16545 states and 18729 transitions. [2024-10-12 16:17:32,842 INFO L78 Accepts]: Start accepts. Automaton has 16545 states and 18729 transitions. Word has length 578 [2024-10-12 16:17:32,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:32,843 INFO L471 AbstractCegarLoop]: Abstraction has 16545 states and 18729 transitions. [2024-10-12 16:17:32,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:32,843 INFO L276 IsEmpty]: Start isEmpty. Operand 16545 states and 18729 transitions. [2024-10-12 16:17:32,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2024-10-12 16:17:32,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:32,854 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:17:32,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 16:17:33,054 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,SelfDestructingSolverStorable14 [2024-10-12 16:17:33,055 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:33,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:33,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1613681335, now seen corresponding path program 1 times [2024-10-12 16:17:33,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:33,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154000101] [2024-10-12 16:17:33,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:33,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:33,526 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 437 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-12 16:17:33,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:33,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154000101] [2024-10-12 16:17:33,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154000101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:33,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:17:33,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:17:33,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373134039] [2024-10-12 16:17:33,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:33,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:33,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:33,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:33,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:33,528 INFO L87 Difference]: Start difference. First operand 16545 states and 18729 transitions. Second operand has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:34,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:34,748 INFO L93 Difference]: Finished difference Result 40866 states and 46390 transitions. [2024-10-12 16:17:34,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:34,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 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 612 [2024-10-12 16:17:34,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:34,769 INFO L225 Difference]: With dead ends: 40866 [2024-10-12 16:17:34,769 INFO L226 Difference]: Without dead ends: 21631 [2024-10-12 16:17:34,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:34,779 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 179 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:34,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 520 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:17:34,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21631 states. [2024-10-12 16:17:34,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21631 to 19537. [2024-10-12 16:17:34,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19537 states, 19536 states have (on average 1.0825143325143325) internal successors, (21148), 19536 states have internal predecessors, (21148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:34,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19537 states to 19537 states and 21148 transitions. [2024-10-12 16:17:34,966 INFO L78 Accepts]: Start accepts. Automaton has 19537 states and 21148 transitions. Word has length 612 [2024-10-12 16:17:34,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:34,966 INFO L471 AbstractCegarLoop]: Abstraction has 19537 states and 21148 transitions. [2024-10-12 16:17:34,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:34,967 INFO L276 IsEmpty]: Start isEmpty. Operand 19537 states and 21148 transitions. [2024-10-12 16:17:34,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2024-10-12 16:17:34,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:34,974 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:34,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 16:17:34,974 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:34,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:34,975 INFO L85 PathProgramCache]: Analyzing trace with hash -127897499, now seen corresponding path program 1 times [2024-10-12 16:17:34,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:34,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725130652] [2024-10-12 16:17:34,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:34,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:36,262 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 223 proven. 405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:17:36,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:36,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725130652] [2024-10-12 16:17:36,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725130652] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:17:36,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130746139] [2024-10-12 16:17:36,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:36,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:17:36,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:17:36,264 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:17:36,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 16:17:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:36,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-12 16:17:36,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:17:38,855 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 473 proven. 49 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-12 16:17:38,855 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 16:17:41,188 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 473 proven. 49 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-12 16:17:41,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130746139] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 16:17:41,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 16:17:41,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2024-10-12 16:17:41,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273023636] [2024-10-12 16:17:41,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 16:17:41,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-12 16:17:41,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:41,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 16:17:41,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-10-12 16:17:41,192 INFO L87 Difference]: Start difference. First operand 19537 states and 21148 transitions. Second operand has 15 states, 15 states have (on average 107.06666666666666) internal successors, (1606), 15 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:53,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:53,357 INFO L93 Difference]: Finished difference Result 78005 states and 83752 transitions. [2024-10-12 16:17:53,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-10-12 16:17:53,358 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 107.06666666666666) internal successors, (1606), 15 states have internal predecessors, (1606), 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 722 [2024-10-12 16:17:53,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:53,410 INFO L225 Difference]: With dead ends: 78005 [2024-10-12 16:17:53,410 INFO L226 Difference]: Without dead ends: 57015 [2024-10-12 16:17:53,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1549 GetRequests, 1472 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2321 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1230, Invalid=4932, Unknown=0, NotChecked=0, Total=6162 [2024-10-12 16:17:53,425 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 11566 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 17155 mSolverCounterSat, 4218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11566 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 21373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4218 IncrementalHoareTripleChecker+Valid, 17155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:53,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11566 Valid, 470 Invalid, 21373 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4218 Valid, 17155 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2024-10-12 16:17:53,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57015 states. [2024-10-12 16:17:53,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57015 to 21029. [2024-10-12 16:17:53,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21029 states, 21028 states have (on average 1.070049457865703) internal successors, (22501), 21028 states have internal predecessors, (22501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:53,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21029 states to 21029 states and 22501 transitions. [2024-10-12 16:17:53,771 INFO L78 Accepts]: Start accepts. Automaton has 21029 states and 22501 transitions. Word has length 722 [2024-10-12 16:17:53,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:53,771 INFO L471 AbstractCegarLoop]: Abstraction has 21029 states and 22501 transitions. [2024-10-12 16:17:53,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 107.06666666666666) internal successors, (1606), 15 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:53,772 INFO L276 IsEmpty]: Start isEmpty. Operand 21029 states and 22501 transitions. [2024-10-12 16:17:53,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2024-10-12 16:17:53,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:53,782 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:17:53,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 16:17:53,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:17:53,983 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:53,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:53,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1916225527, now seen corresponding path program 1 times [2024-10-12 16:17:53,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:53,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364053641] [2024-10-12 16:17:53,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:53,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:55,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 478 proven. 357 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2024-10-12 16:17:55,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:55,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364053641] [2024-10-12 16:17:55,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364053641] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:17:55,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764142357] [2024-10-12 16:17:55,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:55,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:17:55,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:17:55,101 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:17:55,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 16:17:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:55,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:17:55,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:17:55,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2024-10-12 16:17:55,355 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:17:55,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764142357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:55,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:17:55,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-12 16:17:55,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47731202] [2024-10-12 16:17:55,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:55,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:55,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:55,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:55,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 16:17:55,357 INFO L87 Difference]: Start difference. First operand 21029 states and 22501 transitions. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:56,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:56,203 INFO L93 Difference]: Finished difference Result 41456 states and 44367 transitions. [2024-10-12 16:17:56,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:56,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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 780 [2024-10-12 16:17:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:56,220 INFO L225 Difference]: With dead ends: 41456 [2024-10-12 16:17:56,221 INFO L226 Difference]: Without dead ends: 20428 [2024-10-12 16:17:56,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 781 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-10-12 16:17:56,232 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 278 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:56,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 526 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 16:17:56,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20428 states. [2024-10-12 16:17:56,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20428 to 20129. [2024-10-12 16:17:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20129 states, 20128 states have (on average 1.0421800476947536) internal successors, (20977), 20128 states have internal predecessors, (20977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:56,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20129 states to 20129 states and 20977 transitions. [2024-10-12 16:17:56,385 INFO L78 Accepts]: Start accepts. Automaton has 20129 states and 20977 transitions. Word has length 780 [2024-10-12 16:17:56,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:56,386 INFO L471 AbstractCegarLoop]: Abstraction has 20129 states and 20977 transitions. [2024-10-12 16:17:56,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:56,386 INFO L276 IsEmpty]: Start isEmpty. Operand 20129 states and 20977 transitions. [2024-10-12 16:17:56,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 887 [2024-10-12 16:17:56,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:56,397 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-12 16:17:56,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 16:17:56,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-12 16:17:56,598 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:56,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:56,599 INFO L85 PathProgramCache]: Analyzing trace with hash 414574826, now seen corresponding path program 1 times [2024-10-12 16:17:56,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:56,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681619041] [2024-10-12 16:17:56,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:56,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:57,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 684 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2024-10-12 16:17:57,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:57,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681619041] [2024-10-12 16:17:57,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681619041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:57,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:17:57,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:17:57,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048867235] [2024-10-12 16:17:57,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:57,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:57,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:57,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:57,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:57,113 INFO L87 Difference]: Start difference. First operand 20129 states and 20977 transitions. Second operand has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:57,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:57,984 INFO L93 Difference]: Finished difference Result 44157 states and 46028 transitions. [2024-10-12 16:17:57,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:57,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 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 886 [2024-10-12 16:17:57,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:58,009 INFO L225 Difference]: With dead ends: 44157 [2024-10-12 16:17:58,009 INFO L226 Difference]: Without dead ends: 24328 [2024-10-12 16:17:58,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:58,022 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 347 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:58,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 147 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 16:17:58,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24328 states. [2024-10-12 16:17:58,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24328 to 22220. [2024-10-12 16:17:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22220 states, 22219 states have (on average 1.0407309059813672) internal successors, (23124), 22219 states have internal predecessors, (23124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22220 states to 22220 states and 23124 transitions. [2024-10-12 16:17:58,220 INFO L78 Accepts]: Start accepts. Automaton has 22220 states and 23124 transitions. Word has length 886 [2024-10-12 16:17:58,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:58,221 INFO L471 AbstractCegarLoop]: Abstraction has 22220 states and 23124 transitions. [2024-10-12 16:17:58,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:58,221 INFO L276 IsEmpty]: Start isEmpty. Operand 22220 states and 23124 transitions. [2024-10-12 16:17:58,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 900 [2024-10-12 16:17:58,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:58,233 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:58,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 16:17:58,234 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:58,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:58,234 INFO L85 PathProgramCache]: Analyzing trace with hash 704865570, now seen corresponding path program 1 times [2024-10-12 16:17:58,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:58,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325388672] [2024-10-12 16:17:58,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:58,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:58,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 748 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-10-12 16:17:58,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:58,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325388672] [2024-10-12 16:17:58,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325388672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:58,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:17:58,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:17:58,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756556931] [2024-10-12 16:17:58,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:58,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:58,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:58,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:58,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:58,722 INFO L87 Difference]: Start difference. First operand 22220 states and 23124 transitions. Second operand has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:59,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:59,606 INFO L93 Difference]: Finished difference Result 47144 states and 49079 transitions. [2024-10-12 16:17:59,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:59,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 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 899 [2024-10-12 16:17:59,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:59,633 INFO L225 Difference]: With dead ends: 47144 [2024-10-12 16:17:59,633 INFO L226 Difference]: Without dead ends: 25224 [2024-10-12 16:17:59,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:59,644 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 32 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:59,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 547 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 16:17:59,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25224 states. [2024-10-12 16:17:59,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25224 to 24624. [2024-10-12 16:17:59,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24624 states, 24623 states have (on average 1.0386224261868984) internal successors, (25574), 24623 states have internal predecessors, (25574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:59,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24624 states to 24624 states and 25574 transitions. [2024-10-12 16:17:59,856 INFO L78 Accepts]: Start accepts. Automaton has 24624 states and 25574 transitions. Word has length 899 [2024-10-12 16:17:59,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:59,857 INFO L471 AbstractCegarLoop]: Abstraction has 24624 states and 25574 transitions. [2024-10-12 16:17:59,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:59,857 INFO L276 IsEmpty]: Start isEmpty. Operand 24624 states and 25574 transitions. [2024-10-12 16:17:59,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 935 [2024-10-12 16:17:59,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:59,870 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:59,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 16:17:59,871 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:59,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:59,871 INFO L85 PathProgramCache]: Analyzing trace with hash -329360357, now seen corresponding path program 1 times [2024-10-12 16:17:59,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:59,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603964104] [2024-10-12 16:17:59,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:59,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:18:00,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1843 backedges. 798 proven. 49 refuted. 0 times theorem prover too weak. 996 trivial. 0 not checked. [2024-10-12 16:18:00,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:18:00,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603964104] [2024-10-12 16:18:00,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603964104] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:18:00,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142972384] [2024-10-12 16:18:00,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:18:00,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:18:00,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:18:00,298 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:18:00,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 16:18:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:18:00,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 16:18:00,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:18:00,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1843 backedges. 798 proven. 49 refuted. 0 times theorem prover too weak. 996 trivial. 0 not checked. [2024-10-12 16:18:00,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 16:18:00,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1843 backedges. 798 proven. 49 refuted. 0 times theorem prover too weak. 996 trivial. 0 not checked. [2024-10-12 16:18:00,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142972384] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 16:18:00,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 16:18:00,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-12 16:18:00,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782816851] [2024-10-12 16:18:00,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 16:18:00,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 16:18:00,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:18:00,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 16:18:00,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:18:00,851 INFO L87 Difference]: Start difference. First operand 24624 states and 25574 transitions. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:18:02,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:18:02,587 INFO L93 Difference]: Finished difference Result 58224 states and 60473 transitions. [2024-10-12 16:18:02,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 16:18:02,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 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 934 [2024-10-12 16:18:02,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:18:02,624 INFO L225 Difference]: With dead ends: 58224 [2024-10-12 16:18:02,625 INFO L226 Difference]: Without dead ends: 33900 [2024-10-12 16:18:02,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1870 GetRequests, 1865 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:18:02,634 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 940 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2221 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 2561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 2221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:18:02,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 190 Invalid, 2561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 2221 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:18:02,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33900 states. [2024-10-12 16:18:02,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33900 to 23721. [2024-10-12 16:18:02,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23721 states, 23720 states have (on average 1.0355817875210793) internal successors, (24564), 23720 states have internal predecessors, (24564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:18:02,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23721 states to 23721 states and 24564 transitions. [2024-10-12 16:18:02,875 INFO L78 Accepts]: Start accepts. Automaton has 23721 states and 24564 transitions. Word has length 934 [2024-10-12 16:18:02,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:18:02,876 INFO L471 AbstractCegarLoop]: Abstraction has 23721 states and 24564 transitions. [2024-10-12 16:18:02,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:18:02,876 INFO L276 IsEmpty]: Start isEmpty. Operand 23721 states and 24564 transitions. [2024-10-12 16:18:02,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 972 [2024-10-12 16:18:02,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:18:02,891 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:18:02,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 16:18:03,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:18:03,092 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:18:03,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:18:03,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1284016719, now seen corresponding path program 1 times [2024-10-12 16:18:03,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:18:03,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311477761] [2024-10-12 16:18:03,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:18:03,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:18:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:18:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 800 proven. 179 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-12 16:18:04,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:18:04,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311477761] [2024-10-12 16:18:04,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311477761] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:18:04,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210643669] [2024-10-12 16:18:04,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:18:04,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:18:04,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:18:04,675 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:18:04,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 16:18:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:18:04,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 16:18:04,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:18:05,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 769 proven. 49 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2024-10-12 16:18:05,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 16:18:05,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 818 proven. 0 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2024-10-12 16:18:05,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210643669] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 16:18:05,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 16:18:05,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2024-10-12 16:18:05,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528782682] [2024-10-12 16:18:05,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:18:05,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:18:05,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:18:05,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:18:05,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-12 16:18:05,885 INFO L87 Difference]: Start difference. First operand 23721 states and 24564 transitions. Second operand has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:18:07,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:18:07,287 INFO L93 Difference]: Finished difference Result 51947 states and 53745 transitions. [2024-10-12 16:18:07,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:18:07,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 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 971 [2024-10-12 16:18:07,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:18:07,315 INFO L225 Difference]: With dead ends: 51947 [2024-10-12 16:18:07,315 INFO L226 Difference]: Without dead ends: 28227 [2024-10-12 16:18:07,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1946 GetRequests, 1938 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-12 16:18:07,330 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 336 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:18:07,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 97 Invalid, 1892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1607 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 16:18:07,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28227 states. [2024-10-12 16:18:07,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28227 to 23721. [2024-10-12 16:18:07,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23721 states, 23720 states have (on average 1.0354131534569984) internal successors, (24560), 23720 states have internal predecessors, (24560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:18:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23721 states to 23721 states and 24560 transitions. [2024-10-12 16:18:07,548 INFO L78 Accepts]: Start accepts. Automaton has 23721 states and 24560 transitions. Word has length 971 [2024-10-12 16:18:07,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:18:07,549 INFO L471 AbstractCegarLoop]: Abstraction has 23721 states and 24560 transitions. [2024-10-12 16:18:07,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:18:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 23721 states and 24560 transitions. [2024-10-12 16:18:07,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 998 [2024-10-12 16:18:07,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:18:07,564 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:18:07,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 16:18:07,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:18:07,765 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:18:07,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:18:07,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1758077825, now seen corresponding path program 1 times [2024-10-12 16:18:07,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:18:07,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47805716] [2024-10-12 16:18:07,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:18:07,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:18:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:18:08,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 892 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2024-10-12 16:18:08,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:18:08,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47805716] [2024-10-12 16:18:08,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47805716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:18:08,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:18:08,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:18:08,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813610004] [2024-10-12 16:18:08,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:18:08,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:18:08,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:18:08,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:18:08,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:18:08,269 INFO L87 Difference]: Start difference. First operand 23721 states and 24560 transitions. Second operand has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:18:09,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:18:09,026 INFO L93 Difference]: Finished difference Result 42315 states and 43688 transitions. [2024-10-12 16:18:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:18:09,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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 997 [2024-10-12 16:18:09,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:18:09,044 INFO L225 Difference]: With dead ends: 42315 [2024-10-12 16:18:09,044 INFO L226 Difference]: Without dead ends: 17399 [2024-10-12 16:18:09,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:18:09,057 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 51 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:18:09,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 366 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 16:18:09,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17399 states. [2024-10-12 16:18:09,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17399 to 14701. [2024-10-12 16:18:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14701 states, 14700 states have (on average 1.0233333333333334) internal successors, (15043), 14700 states have internal predecessors, (15043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:18:09,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14701 states to 14701 states and 15043 transitions. [2024-10-12 16:18:09,192 INFO L78 Accepts]: Start accepts. Automaton has 14701 states and 15043 transitions. Word has length 997 [2024-10-12 16:18:09,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:18:09,192 INFO L471 AbstractCegarLoop]: Abstraction has 14701 states and 15043 transitions. [2024-10-12 16:18:09,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:18:09,193 INFO L276 IsEmpty]: Start isEmpty. Operand 14701 states and 15043 transitions. [2024-10-12 16:18:09,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1442 [2024-10-12 16:18:09,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:18:09,212 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2024-10-12 16:18:09,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 16:18:09,212 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:18:09,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:18:09,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1098653254, now seen corresponding path program 1 times [2024-10-12 16:18:09,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:18:09,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614012475] [2024-10-12 16:18:09,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:18:09,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:18:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:18:09,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3360 backedges. 1971 proven. 0 refuted. 0 times theorem prover too weak. 1389 trivial. 0 not checked. [2024-10-12 16:18:09,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:18:09,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614012475] [2024-10-12 16:18:09,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614012475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:18:09,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:18:09,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:18:09,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198022877] [2024-10-12 16:18:09,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:18:09,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:18:09,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:18:09,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:18:09,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:18:09,772 INFO L87 Difference]: Start difference. First operand 14701 states and 15043 transitions. Second operand has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:18:10,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:18:10,385 INFO L93 Difference]: Finished difference Result 28799 states and 29493 transitions. [2024-10-12 16:18:10,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:18:10,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 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 1441 [2024-10-12 16:18:10,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:18:10,387 INFO L225 Difference]: With dead ends: 28799 [2024-10-12 16:18:10,387 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 16:18:10,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:18:10,397 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 26 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:18:10,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 408 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 16:18:10,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 16:18:10,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 16:18:10,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:18:10,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 16:18:10,400 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1441 [2024-10-12 16:18:10,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:18:10,401 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 16:18:10,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:18:10,401 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 16:18:10,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 16:18:10,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 16:18:10,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 16:18:10,407 INFO L407 BasicCegarLoop]: Path program 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] [2024-10-12 16:18:10,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 16:18:16,618 WARN L286 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 620 DAG size of output: 775 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-12 16:18:19,347 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 16:18:19,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 04:18:19 BoogieIcfgContainer [2024-10-12 16:18:19,381 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 16:18:19,382 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 16:18:19,382 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 16:18:19,382 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 16:18:19,382 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:17:04" (3/4) ... [2024-10-12 16:18:19,384 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 16:18:19,412 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-12 16:18:19,414 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 16:18:19,415 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 16:18:19,416 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 16:18:19,581 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 16:18:19,582 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 16:18:19,582 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 16:18:19,582 INFO L158 Benchmark]: Toolchain (without parser) took 77919.62ms. Allocated memory was 205.5MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 133.6MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 233.0MB. Max. memory is 16.1GB. [2024-10-12 16:18:19,583 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 16:18:19,583 INFO L158 Benchmark]: CACSL2BoogieTranslator took 784.74ms. Allocated memory is still 205.5MB. Free memory was 133.4MB in the beginning and 113.7MB in the end (delta: 19.7MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2024-10-12 16:18:19,583 INFO L158 Benchmark]: Boogie Procedure Inliner took 179.00ms. Allocated memory is still 205.5MB. Free memory was 113.7MB in the beginning and 76.0MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-12 16:18:19,584 INFO L158 Benchmark]: Boogie Preprocessor took 270.30ms. Allocated memory is still 205.5MB. Free memory was 76.0MB in the beginning and 140.5MB in the end (delta: -64.5MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. [2024-10-12 16:18:19,584 INFO L158 Benchmark]: RCFGBuilder took 1991.54ms. Allocated memory was 205.5MB in the beginning and 333.4MB in the end (delta: 127.9MB). Free memory was 140.5MB in the beginning and 207.5MB in the end (delta: -67.0MB). Peak memory consumption was 128.0MB. Max. memory is 16.1GB. [2024-10-12 16:18:19,586 INFO L158 Benchmark]: TraceAbstraction took 74487.39ms. Allocated memory was 333.4MB in the beginning and 2.0GB in the end (delta: 1.6GB). Free memory was 207.5MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-10-12 16:18:19,586 INFO L158 Benchmark]: Witness Printer took 199.97ms. Allocated memory is still 2.0GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-12 16:18:19,586 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 784.74ms. Allocated memory is still 205.5MB. Free memory was 133.4MB in the beginning and 113.7MB in the end (delta: 19.7MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 179.00ms. Allocated memory is still 205.5MB. Free memory was 113.7MB in the beginning and 76.0MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 270.30ms. Allocated memory is still 205.5MB. Free memory was 76.0MB in the beginning and 140.5MB in the end (delta: -64.5MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. * RCFGBuilder took 1991.54ms. Allocated memory was 205.5MB in the beginning and 333.4MB in the end (delta: 127.9MB). Free memory was 140.5MB in the beginning and 207.5MB in the end (delta: -67.0MB). Peak memory consumption was 128.0MB. Max. memory is 16.1GB. * TraceAbstraction took 74487.39ms. Allocated memory was 333.4MB in the beginning and 2.0GB in the end (delta: 1.6GB). Free memory was 207.5MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 199.97ms. Allocated memory is still 2.0GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. 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: 170]: 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, 362 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 65.5s, OverallIterations: 24, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 38.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17591 SdHoareTripleChecker+Valid, 33.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17591 mSDsluCounter, 9394 SdHoareTripleChecker+Invalid, 28.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1201 mSDsCounter, 8469 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38363 IncrementalHoareTripleChecker+Invalid, 46832 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8469 mSolverCounterUnsat, 8193 mSDtfsCounter, 38363 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7208 GetRequests, 7090 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2337 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24624occurred in iteration=20, InterpolantAutomatonStates: 145, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 68687 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 17769 NumberOfCodeBlocks, 17769 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 20363 ConstructedInterpolants, 0 QuantifiedInterpolants, 64795 SizeOfPredicates, 6 NumberOfNonLiveVariables, 5235 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 33 InterpolantComputations, 22 PerfectInterpolantSequences, 25047/26475 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: 1776]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853)) || (((((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853)) && (0 <= ((long long) a0 + 145))) && (0 <= ((long long) a29 + 192415)))) || (((((long long) a0 + 99) <= 0) && (a2 == 1)) && (((long long) a4 + 86) <= 0))) || (((((2 == a2) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853))) || ((((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853)) && (a2 == 4))) || (((((((long long) 89 + a4) <= 0) && (5 <= a2)) && (0 <= ((long long) a29 + 192415))) || ((((0 <= ((long long) a0 + 60)) && (5 <= a2)) && (((long long) a4 + 86) <= 0)) && (0 <= ((long long) a29 + 192415)))) && (a29 <= 43))) || ((((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (5 <= a2)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853))) || (((((long long) 89 + a4) <= 0) && (a2 == 4)) && (a29 <= 43))) || ((((0 <= ((long long) 143 + a0)) && (((long long) 42 + a4) <= 0)) && (((long long) a0 + 99) <= 0)) && (3 == a2))) || ((((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853) && ((((2 == a2) && (((long long) 89 + a4) <= 0)) || ((((2 == a2) && (0 <= ((long long) a0 + 60))) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 127) <= 0))) || ((((2 == a2) && (44 <= a29)) && (0 <= ((long long) a0 + 60))) && (((long long) a4 + 86) <= 0))))) || (((((((long long) 148 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (44 <= a29)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853)) && (3 == a2))) || (((5 <= a2) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853)) && ((((44 <= a29) && (0 <= ((long long) a0 + 60))) && (((long long) a4 + 86) <= 0)) || ((44 <= a29) && (((long long) 89 + a4) <= 0))))) || (((((long long) 148 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (a2 == 1))) || (((((((long long) 148 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853)) && (a2 == 4))) || (((((((long long) 42 + a4) <= 0) && (44 <= a29)) && (((long long) a0 + 99) <= 0)) && (5 <= a2)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853))) || ((((0 <= ((long long) a29 + 15)) && (((long long) a0 + 99) <= 0)) && (((long long) a4 + 86) <= 0)) && (3 == a2))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (5 <= a2))) || (((((0 <= ((long long) a0 + 60)) && (((long long) a4 + 86) <= 0)) && (a2 == 4)) && (a29 <= 43)) && (0 <= ((long long) a29 + 192415)))) || ((((((long long) 42 + a4) <= 0) && (((long long) a0 + 99) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0))) || (((((((long long) a0 + 99) <= 0) && (((long long) a4 + 86) <= 0)) && (3 == a2)) || ((((long long) a0 + 99) <= 0) && (((long long) 89 + a4) <= 0))) && (((long long) a29 + 144) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (a2 == 1)) && (a29 <= 43))) || ((((2 == a2) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (((long long) a0 + 147) <= 0))) || ((((0 <= ((long long) 97 + a0)) && (a2 == 1)) && (((long long) a4 + 86) <= 0)) && (a29 <= 43))) || (((44 <= a29) && (((long long) a0 + 99) <= 0)) && (((long long) 89 + a4) <= 0))) || (((((((long long) 42 + a4) <= 0) && (((long long) a0 + 99) <= 0)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853)) && (3 == a2)) && (0 <= ((long long) a0 + 145)))) || ((((((long long) 89 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) <= 185853)) && (a2 == 4))) || (((((long long) a0 + 99) <= 0) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) a0 + 145)))) || ((((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (5 <= a2)) && (a29 <= 43)) && (0 <= ((long long) a29 + 192415)))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 99) <= 0)) && (5 <= a2)) && (a29 <= 43))) || (((0 <= ((long long) 97 + a0)) && (((long long) a4 + 86) <= 0)) && (3 == a2))) || (((((long long) 89 + a4) <= 0) && (3 == a2)) && (((long long) a29 + 144) <= 0))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (3 == a2)) && (a29 <= 43))) RESULT: Ultimate proved your program to be correct! [2024-10-12 16:18:19,610 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