./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/Problem03_label30.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/Problem03_label30.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 a272bf0f73a58d72dfba23a9c902bbeb665b6b76cc21acf92951a09cb8e04c47 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:19:15,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:19:15,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:19:15,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:19:15,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:19:15,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:19:15,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:19:15,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:19:15,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:19:15,128 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:19:15,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:19:15,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:19:15,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:19:15,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:19:15,132 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:19:15,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:19:15,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:19:15,133 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:19:15,134 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:19:15,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:19:15,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:19:15,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:19:15,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:19:15,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:19:15,136 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:19:15,136 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:19:15,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:19:15,136 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:19:15,137 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:19:15,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:19:15,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:19:15,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:19:15,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:19:15,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:19:15,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:19:15,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:19:15,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:19:15,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:19:15,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:19:15,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:19:15,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:19:15,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:19:15,140 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 -> a272bf0f73a58d72dfba23a9c902bbeb665b6b76cc21acf92951a09cb8e04c47 [2024-10-12 15:19:15,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:19:15,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:19:15,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:19:15,413 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:19:15,413 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:19:15,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label30.c [2024-10-12 15:19:16,837 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:19:17,173 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:19:17,174 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label30.c [2024-10-12 15:19:17,198 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45782a081/38d6880948ff46cc965b209617f6b4cf/FLAGae27e86e1 [2024-10-12 15:19:17,214 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45782a081/38d6880948ff46cc965b209617f6b4cf [2024-10-12 15:19:17,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:19:17,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:19:17,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:19:17,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:19:17,227 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:19:17,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:19:17" (1/1) ... [2024-10-12 15:19:17,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18a36d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:17, skipping insertion in model container [2024-10-12 15:19:17,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:19:17" (1/1) ... [2024-10-12 15:19:17,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:19:17,805 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/Problem03_label30.c[57849,57862] [2024-10-12 15:19:17,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:19:17,856 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:19:18,025 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/Problem03_label30.c[57849,57862] [2024-10-12 15:19:18,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:19:18,061 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:19:18,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:18 WrapperNode [2024-10-12 15:19:18,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:19:18,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:19:18,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:19:18,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:19:18,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:18" (1/1) ... [2024-10-12 15:19:18,118 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:18" (1/1) ... [2024-10-12 15:19:18,219 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-10-12 15:19:18,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:19:18,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:19:18,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:19:18,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:19:18,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:18" (1/1) ... [2024-10-12 15:19:18,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:18" (1/1) ... [2024-10-12 15:19:18,241 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:18" (1/1) ... [2024-10-12 15:19:18,294 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 15:19:18,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:18" (1/1) ... [2024-10-12 15:19:18,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:18" (1/1) ... [2024-10-12 15:19:18,386 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:18" (1/1) ... [2024-10-12 15:19:18,401 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:18" (1/1) ... [2024-10-12 15:19:18,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:18" (1/1) ... [2024-10-12 15:19:18,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:18" (1/1) ... [2024-10-12 15:19:18,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:19:18,497 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:19:18,497 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:19:18,497 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:19:18,500 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:18" (1/1) ... [2024-10-12 15:19:18,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:19:18,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:19:18,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 15:19:18,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 15:19:18,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:19:18,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:19:18,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:19:18,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:19:18,693 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:19:18,695 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:19:20,525 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-12 15:19:20,525 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:19:20,585 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:19:20,588 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:19:20,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:19:20 BoogieIcfgContainer [2024-10-12 15:19:20,589 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:19:20,591 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:19:20,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:19:20,594 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:19:20,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:19:17" (1/3) ... [2024-10-12 15:19:20,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a21251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:19:20, skipping insertion in model container [2024-10-12 15:19:20,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:18" (2/3) ... [2024-10-12 15:19:20,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a21251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:19:20, skipping insertion in model container [2024-10-12 15:19:20,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:19:20" (3/3) ... [2024-10-12 15:19:20,597 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label30.c [2024-10-12 15:19:20,613 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:19:20,614 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:19:20,689 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:19:20,698 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;@22b1713d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:19:20,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:19:20,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:20,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-12 15:19:20,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:20,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:20,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:20,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:20,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2055799440, now seen corresponding path program 1 times [2024-10-12 15:19:20,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:20,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219119219] [2024-10-12 15:19:20,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:20,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:21,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:21,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219119219] [2024-10-12 15:19:21,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219119219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:21,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:21,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:21,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188000667] [2024-10-12 15:19:21,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:21,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:19:21,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:21,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:19:21,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:19:21,389 INFO L87 Difference]: Start difference. First operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 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 87.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:21,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:21,440 INFO L93 Difference]: Finished difference Result 479 states and 913 transitions. [2024-10-12 15:19:21,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:19:21,443 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 87.0) internal successors, (174), 2 states have internal predecessors, (174), 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 174 [2024-10-12 15:19:21,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:21,452 INFO L225 Difference]: With dead ends: 479 [2024-10-12 15:19:21,452 INFO L226 Difference]: Without dead ends: 238 [2024-10-12 15:19:21,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:19:21,458 INFO L432 NwaCegarLoop]: 392 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, 392 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:21,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:19:21,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-12 15:19:21,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-12 15:19:21,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2024-10-12 15:19:21,505 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 174 [2024-10-12 15:19:21,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:21,507 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2024-10-12 15:19:21,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 87.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:21,507 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2024-10-12 15:19:21,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-12 15:19:21,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:21,514 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:21,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:19:21,515 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:21,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:21,515 INFO L85 PathProgramCache]: Analyzing trace with hash 443332950, now seen corresponding path program 1 times [2024-10-12 15:19:21,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:21,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907436466] [2024-10-12 15:19:21,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:21,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:22,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:22,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907436466] [2024-10-12 15:19:22,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907436466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:22,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:22,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:22,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793400302] [2024-10-12 15:19:22,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:22,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:22,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:22,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:22,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:22,136 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:23,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:23,111 INFO L93 Difference]: Finished difference Result 686 states and 1135 transitions. [2024-10-12 15:19:23,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:23,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 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 174 [2024-10-12 15:19:23,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:23,115 INFO L225 Difference]: With dead ends: 686 [2024-10-12 15:19:23,115 INFO L226 Difference]: Without dead ends: 449 [2024-10-12 15:19:23,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:23,118 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 103 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:23,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 90 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 15:19:23,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-10-12 15:19:23,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2024-10-12 15:19:23,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.6233183856502242) internal successors, (724), 446 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 724 transitions. [2024-10-12 15:19:23,156 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 724 transitions. Word has length 174 [2024-10-12 15:19:23,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:23,158 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 724 transitions. [2024-10-12 15:19:23,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:23,159 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 724 transitions. [2024-10-12 15:19:23,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-12 15:19:23,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:23,163 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:23,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:19:23,163 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:23,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:23,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1164418400, now seen corresponding path program 1 times [2024-10-12 15:19:23,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:23,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205914464] [2024-10-12 15:19:23,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:23,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:23,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:23,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:23,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205914464] [2024-10-12 15:19:23,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205914464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:23,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:23,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:23,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057023540] [2024-10-12 15:19:23,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:23,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:23,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:23,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:23,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:23,474 INFO L87 Difference]: Start difference. First operand 447 states and 724 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:24,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:24,240 INFO L93 Difference]: Finished difference Result 1317 states and 2138 transitions. [2024-10-12 15:19:24,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:24,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 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 179 [2024-10-12 15:19:24,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:24,244 INFO L225 Difference]: With dead ends: 1317 [2024-10-12 15:19:24,245 INFO L226 Difference]: Without dead ends: 871 [2024-10-12 15:19:24,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:24,248 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 251 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:24,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 156 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:19:24,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-10-12 15:19:24,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 867. [2024-10-12 15:19:24,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 866 states have (on average 1.5277136258660509) internal successors, (1323), 866 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:24,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1323 transitions. [2024-10-12 15:19:24,284 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1323 transitions. Word has length 179 [2024-10-12 15:19:24,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:24,285 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1323 transitions. [2024-10-12 15:19:24,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:24,285 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1323 transitions. [2024-10-12 15:19:24,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-12 15:19:24,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:24,290 INFO L215 NwaCegarLoop]: trace histogram [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 15:19:24,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:19:24,290 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:24,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:24,292 INFO L85 PathProgramCache]: Analyzing trace with hash 689412823, now seen corresponding path program 1 times [2024-10-12 15:19:24,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:24,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189754458] [2024-10-12 15:19:24,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:24,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:24,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:24,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189754458] [2024-10-12 15:19:24,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189754458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:24,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:24,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:24,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577057780] [2024-10-12 15:19:24,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:24,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:24,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:24,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:24,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:24,466 INFO L87 Difference]: Start difference. First operand 867 states and 1323 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:25,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:25,312 INFO L93 Difference]: Finished difference Result 2565 states and 3930 transitions. [2024-10-12 15:19:25,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:25,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 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 182 [2024-10-12 15:19:25,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:25,320 INFO L225 Difference]: With dead ends: 2565 [2024-10-12 15:19:25,320 INFO L226 Difference]: Without dead ends: 1699 [2024-10-12 15:19:25,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:25,323 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:25,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 90 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:19:25,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2024-10-12 15:19:25,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1683. [2024-10-12 15:19:25,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1682 states have (on average 1.497027348394768) internal successors, (2518), 1682 states have internal predecessors, (2518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2518 transitions. [2024-10-12 15:19:25,365 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2518 transitions. Word has length 182 [2024-10-12 15:19:25,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:25,366 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2518 transitions. [2024-10-12 15:19:25,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:25,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2518 transitions. [2024-10-12 15:19:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-12 15:19:25,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:25,370 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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] [2024-10-12 15:19:25,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:19:25,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:25,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:25,374 INFO L85 PathProgramCache]: Analyzing trace with hash 637269840, now seen corresponding path program 1 times [2024-10-12 15:19:25,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:25,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362830887] [2024-10-12 15:19:25,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:25,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:19:25,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:25,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362830887] [2024-10-12 15:19:25,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362830887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:25,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:25,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:19:25,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653137685] [2024-10-12 15:19:25,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:25,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:25,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:25,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:25,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:25,683 INFO L87 Difference]: Start difference. First operand 1683 states and 2518 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:26,514 INFO L93 Difference]: Finished difference Result 3367 states and 5039 transitions. [2024-10-12 15:19:26,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:26,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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 194 [2024-10-12 15:19:26,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:26,520 INFO L225 Difference]: With dead ends: 3367 [2024-10-12 15:19:26,521 INFO L226 Difference]: Without dead ends: 1685 [2024-10-12 15:19:26,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:26,524 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 236 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:26,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 410 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:19:26,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2024-10-12 15:19:26,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1683. [2024-10-12 15:19:26,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1682 states have (on average 1.316884661117717) internal successors, (2215), 1682 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:26,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2215 transitions. [2024-10-12 15:19:26,561 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2215 transitions. Word has length 194 [2024-10-12 15:19:26,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:26,562 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2215 transitions. [2024-10-12 15:19:26,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:26,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2215 transitions. [2024-10-12 15:19:26,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-12 15:19:26,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:26,566 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:26,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:19:26,567 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:26,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:26,567 INFO L85 PathProgramCache]: Analyzing trace with hash -453655196, now seen corresponding path program 1 times [2024-10-12 15:19:26,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:26,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732909609] [2024-10-12 15:19:26,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:26,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:19:26,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:26,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732909609] [2024-10-12 15:19:26,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732909609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:26,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:26,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:19:26,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798038931] [2024-10-12 15:19:26,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:26,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:26,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:26,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:26,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:26,967 INFO L87 Difference]: Start difference. First operand 1683 states and 2215 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:27,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:27,790 INFO L93 Difference]: Finished difference Result 4186 states and 5498 transitions. [2024-10-12 15:19:27,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:27,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202 [2024-10-12 15:19:27,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:27,801 INFO L225 Difference]: With dead ends: 4186 [2024-10-12 15:19:27,801 INFO L226 Difference]: Without dead ends: 2504 [2024-10-12 15:19:27,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:27,806 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 210 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:27,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 421 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:19:27,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2024-10-12 15:19:27,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2496. [2024-10-12 15:19:27,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2495 states have (on average 1.2705410821643286) internal successors, (3170), 2495 states have internal predecessors, (3170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:27,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 3170 transitions. [2024-10-12 15:19:27,852 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 3170 transitions. Word has length 202 [2024-10-12 15:19:27,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:27,852 INFO L471 AbstractCegarLoop]: Abstraction has 2496 states and 3170 transitions. [2024-10-12 15:19:27,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:27,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 3170 transitions. [2024-10-12 15:19:27,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-12 15:19:27,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:27,859 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:27,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:19:27,860 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:27,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:27,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1868869783, now seen corresponding path program 1 times [2024-10-12 15:19:27,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:27,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647645901] [2024-10-12 15:19:27,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:27,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:28,163 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 15:19:28,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:28,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647645901] [2024-10-12 15:19:28,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647645901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:28,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:28,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:28,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002797629] [2024-10-12 15:19:28,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:28,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:28,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:28,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:28,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:28,166 INFO L87 Difference]: Start difference. First operand 2496 states and 3170 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:29,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:29,011 INFO L93 Difference]: Finished difference Result 7453 states and 9470 transitions. [2024-10-12 15:19:29,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:29,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 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 202 [2024-10-12 15:19:29,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:29,029 INFO L225 Difference]: With dead ends: 7453 [2024-10-12 15:19:29,030 INFO L226 Difference]: Without dead ends: 4958 [2024-10-12 15:19:29,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:29,035 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 259 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:29,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 123 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:19:29,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2024-10-12 15:19:29,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 4949. [2024-10-12 15:19:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4949 states, 4948 states have (on average 1.2621261115602262) internal successors, (6245), 4948 states have internal predecessors, (6245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4949 states to 4949 states and 6245 transitions. [2024-10-12 15:19:29,133 INFO L78 Accepts]: Start accepts. Automaton has 4949 states and 6245 transitions. Word has length 202 [2024-10-12 15:19:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:29,133 INFO L471 AbstractCegarLoop]: Abstraction has 4949 states and 6245 transitions. [2024-10-12 15:19:29,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:29,134 INFO L276 IsEmpty]: Start isEmpty. Operand 4949 states and 6245 transitions. [2024-10-12 15:19:29,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-12 15:19:29,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:29,145 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:19:29,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:19:29,145 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:29,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:29,146 INFO L85 PathProgramCache]: Analyzing trace with hash 510225057, now seen corresponding path program 1 times [2024-10-12 15:19:29,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:29,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219124867] [2024-10-12 15:19:29,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:29,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 15:19:29,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:29,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219124867] [2024-10-12 15:19:29,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219124867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:29,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:29,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:29,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413514290] [2024-10-12 15:19:29,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:29,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:29,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:29,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:29,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:29,606 INFO L87 Difference]: Start difference. First operand 4949 states and 6245 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:30,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:30,460 INFO L93 Difference]: Finished difference Result 13785 states and 17526 transitions. [2024-10-12 15:19:30,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:30,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 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 209 [2024-10-12 15:19:30,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:30,491 INFO L225 Difference]: With dead ends: 13785 [2024-10-12 15:19:30,491 INFO L226 Difference]: Without dead ends: 8837 [2024-10-12 15:19:30,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:30,501 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 211 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:30,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 143 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:19:30,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8837 states. [2024-10-12 15:19:30,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8837 to 8818. [2024-10-12 15:19:30,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8818 states, 8817 states have (on average 1.270046501077464) internal successors, (11198), 8817 states have internal predecessors, (11198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:30,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8818 states to 8818 states and 11198 transitions. [2024-10-12 15:19:30,647 INFO L78 Accepts]: Start accepts. Automaton has 8818 states and 11198 transitions. Word has length 209 [2024-10-12 15:19:30,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:30,647 INFO L471 AbstractCegarLoop]: Abstraction has 8818 states and 11198 transitions. [2024-10-12 15:19:30,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:30,648 INFO L276 IsEmpty]: Start isEmpty. Operand 8818 states and 11198 transitions. [2024-10-12 15:19:30,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-12 15:19:30,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:30,661 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:30,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 15:19:30,662 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:30,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:30,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1060710354, now seen corresponding path program 1 times [2024-10-12 15:19:30,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:30,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474851650] [2024-10-12 15:19:30,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:30,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:31,030 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:31,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:31,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474851650] [2024-10-12 15:19:31,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474851650] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:19:31,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679760249] [2024-10-12 15:19:31,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:31,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:19:31,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:19:31,033 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:19:31,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 15:19:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:31,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:19:31,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:19:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:19:31,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:19:31,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679760249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:31,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:19:31,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:19:31,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775757986] [2024-10-12 15:19:31,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:31,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:31,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:31,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:31,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:19:31,516 INFO L87 Difference]: Start difference. First operand 8818 states and 11198 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:32,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:32,297 INFO L93 Difference]: Finished difference Result 16815 states and 21327 transitions. [2024-10-12 15:19:32,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:32,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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 212 [2024-10-12 15:19:32,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:32,339 INFO L225 Difference]: With dead ends: 16815 [2024-10-12 15:19:32,339 INFO L226 Difference]: Without dead ends: 8608 [2024-10-12 15:19:32,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:19:32,353 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 103 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:32,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 379 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:19:32,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8608 states. [2024-10-12 15:19:32,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8608 to 8606. [2024-10-12 15:19:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8606 states, 8605 states have (on average 1.220337013364323) internal successors, (10501), 8605 states have internal predecessors, (10501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:32,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8606 states to 8606 states and 10501 transitions. [2024-10-12 15:19:32,497 INFO L78 Accepts]: Start accepts. Automaton has 8606 states and 10501 transitions. Word has length 212 [2024-10-12 15:19:32,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:32,498 INFO L471 AbstractCegarLoop]: Abstraction has 8606 states and 10501 transitions. [2024-10-12 15:19:32,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:32,499 INFO L276 IsEmpty]: Start isEmpty. Operand 8606 states and 10501 transitions. [2024-10-12 15:19:32,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-12 15:19:32,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:32,514 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:32,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 15:19:32,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:19:32,715 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:32,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:32,715 INFO L85 PathProgramCache]: Analyzing trace with hash 841605993, now seen corresponding path program 1 times [2024-10-12 15:19:32,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:32,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012588461] [2024-10-12 15:19:32,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:32,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:33,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:33,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012588461] [2024-10-12 15:19:33,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012588461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:33,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:33,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:19:33,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998221503] [2024-10-12 15:19:33,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:33,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:19:33,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:33,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:19:33,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:19:33,068 INFO L87 Difference]: Start difference. First operand 8606 states and 10501 transitions. Second operand has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:34,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:34,079 INFO L93 Difference]: Finished difference Result 17030 states and 20755 transitions. [2024-10-12 15:19:34,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:19:34,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 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 218 [2024-10-12 15:19:34,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:34,096 INFO L225 Difference]: With dead ends: 17030 [2024-10-12 15:19:34,096 INFO L226 Difference]: Without dead ends: 9036 [2024-10-12 15:19:34,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:19:34,106 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 407 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:34,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 180 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 15:19:34,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9036 states. [2024-10-12 15:19:34,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9036 to 8606. [2024-10-12 15:19:34,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8606 states, 8605 states have (on average 1.220337013364323) internal successors, (10501), 8605 states have internal predecessors, (10501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:34,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8606 states to 8606 states and 10501 transitions. [2024-10-12 15:19:34,287 INFO L78 Accepts]: Start accepts. Automaton has 8606 states and 10501 transitions. Word has length 218 [2024-10-12 15:19:34,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:34,288 INFO L471 AbstractCegarLoop]: Abstraction has 8606 states and 10501 transitions. [2024-10-12 15:19:34,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:34,289 INFO L276 IsEmpty]: Start isEmpty. Operand 8606 states and 10501 transitions. [2024-10-12 15:19:34,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-12 15:19:34,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:34,306 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:34,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 15:19:34,306 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:34,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:34,307 INFO L85 PathProgramCache]: Analyzing trace with hash -932817288, now seen corresponding path program 1 times [2024-10-12 15:19:34,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:34,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066227092] [2024-10-12 15:19:34,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:34,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:34,714 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:19:34,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:34,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066227092] [2024-10-12 15:19:34,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066227092] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:19:34,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417679630] [2024-10-12 15:19:34,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:34,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:19:34,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:19:34,717 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 15:19:34,719 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 15:19:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:34,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:19:34,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:19:35,178 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:19:35,178 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:19:35,394 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:19:35,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417679630] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:19:35,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:19:35,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 6 [2024-10-12 15:19:35,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766935350] [2024-10-12 15:19:35,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:19:35,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:19:35,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:35,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:19:35,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:19:35,397 INFO L87 Difference]: Start difference. First operand 8606 states and 10501 transitions. Second operand has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:38,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:38,867 INFO L93 Difference]: Finished difference Result 47846 states and 58352 transitions. [2024-10-12 15:19:38,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 15:19:38,867 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 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 225 [2024-10-12 15:19:38,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:38,941 INFO L225 Difference]: With dead ends: 47846 [2024-10-12 15:19:38,941 INFO L226 Difference]: Without dead ends: 39241 [2024-10-12 15:19:38,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-12 15:19:38,958 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 2937 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 3753 mSolverCounterSat, 1002 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2937 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 4755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1002 IncrementalHoareTripleChecker+Valid, 3753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:38,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2937 Valid, 380 Invalid, 4755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1002 Valid, 3753 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-12 15:19:38,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39241 states. [2024-10-12 15:19:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39241 to 37784. [2024-10-12 15:19:39,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37784 states, 37783 states have (on average 1.170314691792605) internal successors, (44218), 37783 states have internal predecessors, (44218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:39,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37784 states to 37784 states and 44218 transitions. [2024-10-12 15:19:39,612 INFO L78 Accepts]: Start accepts. Automaton has 37784 states and 44218 transitions. Word has length 225 [2024-10-12 15:19:39,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:39,613 INFO L471 AbstractCegarLoop]: Abstraction has 37784 states and 44218 transitions. [2024-10-12 15:19:39,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:39,613 INFO L276 IsEmpty]: Start isEmpty. Operand 37784 states and 44218 transitions. [2024-10-12 15:19:39,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-12 15:19:39,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:39,648 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, 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] [2024-10-12 15:19:39,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 15:19:39,849 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,SelfDestructingSolverStorable10 [2024-10-12 15:19:39,850 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:39,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:39,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1125406014, now seen corresponding path program 1 times [2024-10-12 15:19:39,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:39,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965320691] [2024-10-12 15:19:39,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:39,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:40,482 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:40,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:40,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965320691] [2024-10-12 15:19:40,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965320691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:40,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:40,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:40,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429965235] [2024-10-12 15:19:40,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:40,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:40,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:40,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:40,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:40,485 INFO L87 Difference]: Start difference. First operand 37784 states and 44218 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 2 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:41,345 INFO L93 Difference]: Finished difference Result 82504 states and 96496 transitions. [2024-10-12 15:19:41,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:41,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 2 states have internal predecessors, (232), 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 232 [2024-10-12 15:19:41,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:41,406 INFO L225 Difference]: With dead ends: 82504 [2024-10-12 15:19:41,406 INFO L226 Difference]: Without dead ends: 45332 [2024-10-12 15:19:41,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:41,441 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 165 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:41,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 177 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:19:41,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45332 states. [2024-10-12 15:19:42,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45332 to 45295. [2024-10-12 15:19:42,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45295 states, 45294 states have (on average 1.1625601624939286) internal successors, (52657), 45294 states have internal predecessors, (52657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45295 states to 45295 states and 52657 transitions. [2024-10-12 15:19:42,150 INFO L78 Accepts]: Start accepts. Automaton has 45295 states and 52657 transitions. Word has length 232 [2024-10-12 15:19:42,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:42,150 INFO L471 AbstractCegarLoop]: Abstraction has 45295 states and 52657 transitions. [2024-10-12 15:19:42,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 2 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:42,151 INFO L276 IsEmpty]: Start isEmpty. Operand 45295 states and 52657 transitions. [2024-10-12 15:19:42,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-10-12 15:19:42,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:42,184 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, 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] [2024-10-12 15:19:42,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 15:19:42,184 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:42,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:42,185 INFO L85 PathProgramCache]: Analyzing trace with hash 962460154, now seen corresponding path program 1 times [2024-10-12 15:19:42,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:42,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76322716] [2024-10-12 15:19:42,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:42,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:42,662 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:42,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:42,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76322716] [2024-10-12 15:19:42,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76322716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:42,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:42,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:42,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445516360] [2024-10-12 15:19:42,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:42,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:42,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:42,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:42,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:42,666 INFO L87 Difference]: Start difference. First operand 45295 states and 52657 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:43,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:43,646 INFO L93 Difference]: Finished difference Result 106478 states and 123821 transitions. [2024-10-12 15:19:43,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:43,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 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 235 [2024-10-12 15:19:43,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:43,748 INFO L225 Difference]: With dead ends: 106478 [2024-10-12 15:19:43,749 INFO L226 Difference]: Without dead ends: 62402 [2024-10-12 15:19:43,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:43,787 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 182 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:43,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 149 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:19:43,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62402 states. [2024-10-12 15:19:44,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62402 to 61553. [2024-10-12 15:19:44,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61553 states, 61552 states have (on average 1.1534474915518587) internal successors, (70997), 61552 states have internal predecessors, (70997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:44,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61553 states to 61553 states and 70997 transitions. [2024-10-12 15:19:44,938 INFO L78 Accepts]: Start accepts. Automaton has 61553 states and 70997 transitions. Word has length 235 [2024-10-12 15:19:44,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:44,938 INFO L471 AbstractCegarLoop]: Abstraction has 61553 states and 70997 transitions. [2024-10-12 15:19:44,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:44,939 INFO L276 IsEmpty]: Start isEmpty. Operand 61553 states and 70997 transitions. [2024-10-12 15:19:44,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-12 15:19:44,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:44,967 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:44,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 15:19:44,967 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:44,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:44,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1900144751, now seen corresponding path program 1 times [2024-10-12 15:19:44,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:44,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703662576] [2024-10-12 15:19:44,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:44,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:45,514 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 64 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:45,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:45,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703662576] [2024-10-12 15:19:45,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703662576] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:19:45,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286249342] [2024-10-12 15:19:45,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:45,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:19:45,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:19:45,516 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 15:19:45,517 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 15:19:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:45,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:19:45,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:19:45,742 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:19:45,743 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:19:45,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286249342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:45,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:19:45,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-12 15:19:45,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050324943] [2024-10-12 15:19:45,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:45,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:45,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:45,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:45,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:19:45,746 INFO L87 Difference]: Start difference. First operand 61553 states and 70997 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 2 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:46,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:46,764 INFO L93 Difference]: Finished difference Result 140574 states and 163638 transitions. [2024-10-12 15:19:46,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:46,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 2 states have internal predecessors, (234), 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 239 [2024-10-12 15:19:46,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:46,864 INFO L225 Difference]: With dead ends: 140574 [2024-10-12 15:19:46,864 INFO L226 Difference]: Without dead ends: 79834 [2024-10-12 15:19:46,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:19:46,917 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 187 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:46,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 167 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:19:46,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79834 states. [2024-10-12 15:19:47,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79834 to 79823. [2024-10-12 15:19:47,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79823 states, 79822 states have (on average 1.131768184209867) internal successors, (90340), 79822 states have internal predecessors, (90340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:48,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79823 states to 79823 states and 90340 transitions. [2024-10-12 15:19:48,098 INFO L78 Accepts]: Start accepts. Automaton has 79823 states and 90340 transitions. Word has length 239 [2024-10-12 15:19:48,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:48,098 INFO L471 AbstractCegarLoop]: Abstraction has 79823 states and 90340 transitions. [2024-10-12 15:19:48,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 2 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:48,098 INFO L276 IsEmpty]: Start isEmpty. Operand 79823 states and 90340 transitions. [2024-10-12 15:19:48,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-10-12 15:19:48,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:48,143 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:48,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 15:19:48,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:19:48,344 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:48,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:48,344 INFO L85 PathProgramCache]: Analyzing trace with hash 355042084, now seen corresponding path program 1 times [2024-10-12 15:19:48,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:48,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397903417] [2024-10-12 15:19:48,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:48,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:19:48,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:48,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397903417] [2024-10-12 15:19:48,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397903417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:48,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:48,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:19:48,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503714627] [2024-10-12 15:19:48,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:48,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:48,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:48,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:48,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:48,819 INFO L87 Difference]: Start difference. First operand 79823 states and 90340 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:50,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:50,006 INFO L93 Difference]: Finished difference Result 172471 states and 195238 transitions. [2024-10-12 15:19:50,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:50,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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 267 [2024-10-12 15:19:50,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:50,120 INFO L225 Difference]: With dead ends: 172471 [2024-10-12 15:19:50,120 INFO L226 Difference]: Without dead ends: 94476 [2024-10-12 15:19:50,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:50,166 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 142 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:50,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 431 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:19:50,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94476 states. [2024-10-12 15:19:51,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94476 to 86743. [2024-10-12 15:19:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86743 states, 86742 states have (on average 1.1243572894330314) internal successors, (97529), 86742 states have internal predecessors, (97529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:51,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86743 states to 86743 states and 97529 transitions. [2024-10-12 15:19:51,385 INFO L78 Accepts]: Start accepts. Automaton has 86743 states and 97529 transitions. Word has length 267 [2024-10-12 15:19:51,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:51,386 INFO L471 AbstractCegarLoop]: Abstraction has 86743 states and 97529 transitions. [2024-10-12 15:19:51,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 86743 states and 97529 transitions. [2024-10-12 15:19:51,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-10-12 15:19:51,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:51,734 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:19:51,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 15:19:51,735 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:51,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:51,735 INFO L85 PathProgramCache]: Analyzing trace with hash 134312686, now seen corresponding path program 1 times [2024-10-12 15:19:51,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:51,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684351760] [2024-10-12 15:19:51,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:51,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-12 15:19:52,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:52,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684351760] [2024-10-12 15:19:52,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684351760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:52,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:52,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:52,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642791252] [2024-10-12 15:19:52,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:52,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:52,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:52,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:52,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:52,030 INFO L87 Difference]: Start difference. First operand 86743 states and 97529 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:53,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:53,336 INFO L93 Difference]: Finished difference Result 208922 states and 234767 transitions. [2024-10-12 15:19:53,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:53,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 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 280 [2024-10-12 15:19:53,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:53,497 INFO L225 Difference]: With dead ends: 208922 [2024-10-12 15:19:53,497 INFO L226 Difference]: Without dead ends: 123601 [2024-10-12 15:19:53,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:53,538 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 220 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:53,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 146 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:19:53,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123601 states. [2024-10-12 15:19:55,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123601 to 121159. [2024-10-12 15:19:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121159 states, 121158 states have (on average 1.1232522821439772) internal successors, (136091), 121158 states have internal predecessors, (136091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:55,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121159 states to 121159 states and 136091 transitions. [2024-10-12 15:19:55,812 INFO L78 Accepts]: Start accepts. Automaton has 121159 states and 136091 transitions. Word has length 280 [2024-10-12 15:19:55,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:55,812 INFO L471 AbstractCegarLoop]: Abstraction has 121159 states and 136091 transitions. [2024-10-12 15:19:55,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:55,812 INFO L276 IsEmpty]: Start isEmpty. Operand 121159 states and 136091 transitions. [2024-10-12 15:19:55,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-10-12 15:19:55,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:55,851 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:55,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 15:19:55,851 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:55,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:55,852 INFO L85 PathProgramCache]: Analyzing trace with hash -619747907, now seen corresponding path program 1 times [2024-10-12 15:19:55,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:55,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248940547] [2024-10-12 15:19:55,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:55,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:56,180 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 68 proven. 6 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-12 15:19:56,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:56,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248940547] [2024-10-12 15:19:56,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248940547] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:19:56,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425557619] [2024-10-12 15:19:56,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:56,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:19:56,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:19:56,183 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 15:19:56,184 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 15:19:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:56,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:19:56,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:19:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-12 15:19:56,540 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:19:56,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425557619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:56,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:19:56,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:19:56,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253729701] [2024-10-12 15:19:56,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:56,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:56,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:56,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:56,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:19:56,542 INFO L87 Difference]: Start difference. First operand 121159 states and 136091 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:58,052 INFO L93 Difference]: Finished difference Result 262688 states and 295655 transitions. [2024-10-12 15:19:58,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:58,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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 287 [2024-10-12 15:19:58,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:58,056 INFO L225 Difference]: With dead ends: 262688 [2024-10-12 15:19:58,056 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 15:19:58,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:19:58,148 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 68 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:58,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 415 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 15:19:58,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 15:19:58,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 15:19:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 15:19:58,150 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 287 [2024-10-12 15:19:58,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:58,151 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 15:19:58,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 15:19:58,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 15:19:58,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:19:58,169 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 15:19:58,354 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,SelfDestructingSolverStorable16 [2024-10-12 15:19:58,358 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:58,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 15:20:13,155 WARN L286 SmtUtils]: Spent 14.78s on a formula simplification. DAG size of input: 852 DAG size of output: 814 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-12 15:20:23,678 WARN L286 SmtUtils]: Spent 10.51s on a formula simplification. DAG size of input: 814 DAG size of output: 38 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-10-12 15:20:23,683 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:20:23,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:20:23 BoogieIcfgContainer [2024-10-12 15:20:23,700 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:20:23,700 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:20:23,701 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:20:23,701 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:20:23,701 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:19:20" (3/4) ... [2024-10-12 15:20:23,704 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 15:20:23,740 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 15:20:23,742 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 15:20:23,744 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 15:20:23,746 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 15:20:23,966 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:20:23,966 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 15:20:23,967 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:20:23,968 INFO L158 Benchmark]: Toolchain (without parser) took 66748.42ms. Allocated memory was 155.2MB in the beginning and 13.3GB in the end (delta: 13.2GB). Free memory was 77.9MB in the beginning and 10.9GB in the end (delta: -10.8GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2024-10-12 15:20:23,968 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory was 107.8MB in the beginning and 107.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:20:23,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 840.59ms. Allocated memory is still 155.2MB. Free memory was 77.6MB in the beginning and 67.2MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 15:20:23,969 INFO L158 Benchmark]: Boogie Procedure Inliner took 157.27ms. Allocated memory is still 155.2MB. Free memory was 67.2MB in the beginning and 51.4MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 15:20:23,969 INFO L158 Benchmark]: Boogie Preprocessor took 272.29ms. Allocated memory was 155.2MB in the beginning and 197.1MB in the end (delta: 41.9MB). Free memory was 51.4MB in the beginning and 147.0MB in the end (delta: -95.6MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-10-12 15:20:23,969 INFO L158 Benchmark]: RCFGBuilder took 2092.52ms. Allocated memory is still 197.1MB. Free memory was 147.0MB in the beginning and 90.2MB in the end (delta: 56.8MB). Peak memory consumption was 110.3MB. Max. memory is 16.1GB. [2024-10-12 15:20:23,969 INFO L158 Benchmark]: TraceAbstraction took 63108.77ms. Allocated memory was 197.1MB in the beginning and 13.3GB in the end (delta: 13.1GB). Free memory was 89.1MB in the beginning and 10.9GB in the end (delta: -10.8GB). Peak memory consumption was 6.7GB. Max. memory is 16.1GB. [2024-10-12 15:20:23,970 INFO L158 Benchmark]: Witness Printer took 266.16ms. Allocated memory is still 13.3GB. Free memory was 10.9GB in the beginning and 10.9GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-12 15:20:23,973 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory was 107.8MB in the beginning and 107.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 840.59ms. Allocated memory is still 155.2MB. Free memory was 77.6MB in the beginning and 67.2MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 157.27ms. Allocated memory is still 155.2MB. Free memory was 67.2MB in the beginning and 51.4MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 272.29ms. Allocated memory was 155.2MB in the beginning and 197.1MB in the end (delta: 41.9MB). Free memory was 51.4MB in the beginning and 147.0MB in the end (delta: -95.6MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2092.52ms. Allocated memory is still 197.1MB. Free memory was 147.0MB in the beginning and 90.2MB in the end (delta: 56.8MB). Peak memory consumption was 110.3MB. Max. memory is 16.1GB. * TraceAbstraction took 63108.77ms. Allocated memory was 197.1MB in the beginning and 13.3GB in the end (delta: 13.1GB). Free memory was 89.1MB in the beginning and 10.9GB in the end (delta: -10.8GB). Peak memory consumption was 6.7GB. Max. memory is 16.1GB. * Witness Printer took 266.16ms. Allocated memory is still 13.3GB. Free memory was 10.9GB in the beginning and 10.9GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. 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: 1570]: 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, 240 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.7s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.6s, AutomataDifference: 19.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5928 SdHoareTripleChecker+Valid, 14.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5928 mSDsluCounter, 4249 SdHoareTripleChecker+Invalid, 12.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 630 mSDsCounter, 2826 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13449 IncrementalHoareTripleChecker+Invalid, 16275 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2826 mSolverCounterUnsat, 3619 mSDtfsCounter, 13449 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1239 GetRequests, 1206 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121159occurred in iteration=16, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 13021 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 4674 NumberOfCodeBlocks, 4674 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 4877 ConstructedInterpolants, 0 QuantifiedInterpolants, 9607 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1808 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 1282/1332 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: 1668]: Loop Invariant Derived loop invariant: (((((((((((((((a27 == 1) && (a3 == 0)) && (a6 <= 0)) || ((((a26 == 1) && (a6 == 1)) && (a27 == 1)) && (a3 == 0))) || ((((a11 == 1) && (a14 == 1)) && (a3 == 0)) && (a6 <= 0))) || ((a3 == 1) && (a6 <= 0))) || (((1 <= a3) && (a11 == 1)) && (a6 <= 0))) || (((a7 != 1) && (a6 == 1)) && (a3 == 0))) || ((((a26 == 1) && (a12 == 1)) && (a6 == 1)) && (a3 == 0))) || ((1 <= a3) && (a6 == 1))) || (((a12 == 1) && (a3 == 0)) && (a6 <= 0))) || (((a12 == 1) && (1 <= a3)) && (a6 <= 0))) || (((1 <= a3) && (a27 == 1)) && (a6 <= 0))) || ((((a16 == 1) && (a11 == 1)) && (a3 == 0)) && (a6 <= 0))) || (((a11 == 1) && (a6 == 1)) && (a3 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-12 15:20:24,005 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