./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/Problem13_label32.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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/Problem13_label32.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 da6307e18962eea94383e9cef9de875e55374f6b4142b055a170057bc7246c1d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:38:32,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:38:32,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:38:32,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:38:32,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:38:32,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:38:32,357 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:38:32,358 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:38:32,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:38:32,359 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:38:32,360 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:38:32,360 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:38:32,361 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:38:32,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:38:32,363 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:38:32,363 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:38:32,363 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:38:32,364 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:38:32,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:38:32,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:38:32,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:38:32,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:38:32,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:38:32,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:38:32,369 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:38:32,369 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:38:32,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:38:32,370 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:38:32,370 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:38:32,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:38:32,370 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:38:32,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:38:32,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:38:32,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:38:32,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:38:32,372 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:38:32,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:38:32,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:38:32,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:38:32,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:38:32,373 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:38:32,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:38:32,374 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 -> da6307e18962eea94383e9cef9de875e55374f6b4142b055a170057bc7246c1d [2024-10-13 23:38:32,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:38:32,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:38:32,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:38:32,633 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:38:32,633 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:38:32,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label32.c [2024-10-13 23:38:34,036 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:38:34,462 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:38:34,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label32.c [2024-10-13 23:38:34,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67d1caede/bb725d3cd1a44def97f6e701c1ef4526/FLAG8b28fe6a3 [2024-10-13 23:38:34,513 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67d1caede/bb725d3cd1a44def97f6e701c1ef4526 [2024-10-13 23:38:34,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:38:34,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:38:34,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:38:34,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:38:34,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:38:34,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:38:34" (1/1) ... [2024-10-13 23:38:34,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@104a5523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:34, skipping insertion in model container [2024-10-13 23:38:34,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:38:34" (1/1) ... [2024-10-13 23:38:34,668 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:38:34,885 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/Problem13_label32.c[1533,1546] [2024-10-13 23:38:35,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:38:35,708 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:38:35,721 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/Problem13_label32.c[1533,1546] [2024-10-13 23:38:36,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:38:36,297 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:38:36,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:36 WrapperNode [2024-10-13 23:38:36,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:38:36,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:38:36,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:38:36,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:38:36,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:36" (1/1) ... [2024-10-13 23:38:36,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:36" (1/1) ... [2024-10-13 23:38:36,882 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-13 23:38:36,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:38:36,883 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:38:36,884 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:38:36,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:38:36,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:36" (1/1) ... [2024-10-13 23:38:36,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:36" (1/1) ... [2024-10-13 23:38:37,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:36" (1/1) ... [2024-10-13 23:38:37,245 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-13 23:38:37,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:36" (1/1) ... [2024-10-13 23:38:37,245 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:36" (1/1) ... [2024-10-13 23:38:37,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:36" (1/1) ... [2024-10-13 23:38:37,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:36" (1/1) ... [2024-10-13 23:38:37,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:36" (1/1) ... [2024-10-13 23:38:37,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:36" (1/1) ... [2024-10-13 23:38:37,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:38:37,619 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:38:37,620 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:38:37,620 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:38:37,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:36" (1/1) ... [2024-10-13 23:38:37,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:38:37,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:38:37,724 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-13 23:38:37,730 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-13 23:38:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:38:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:38:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:38:37,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:38:37,834 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:38:37,835 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:38:43,756 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-13 23:38:43,756 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:38:43,828 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:38:43,828 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:38:43,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:38:43 BoogieIcfgContainer [2024-10-13 23:38:43,828 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:38:43,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:38:43,831 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:38:43,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:38:43,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:38:34" (1/3) ... [2024-10-13 23:38:43,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c08703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:38:43, skipping insertion in model container [2024-10-13 23:38:43,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:36" (2/3) ... [2024-10-13 23:38:43,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c08703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:38:43, skipping insertion in model container [2024-10-13 23:38:43,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:38:43" (3/3) ... [2024-10-13 23:38:43,839 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label32.c [2024-10-13 23:38:43,854 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:38:43,854 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:38:43,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:38:43,962 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;@72ee1cdf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:38:43,963 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:38:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 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-13 23:38:43,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 23:38:43,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:43,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:43,982 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:43,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:43,987 INFO L85 PathProgramCache]: Analyzing trace with hash 402648763, now seen corresponding path program 1 times [2024-10-13 23:38:43,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:43,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285248512] [2024-10-13 23:38:43,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:43,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:44,197 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-13 23:38:44,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:44,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285248512] [2024-10-13 23:38:44,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285248512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:44,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:44,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:44,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351115280] [2024-10-13 23:38:44,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:44,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:44,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:44,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:44,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:44,240 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-13 23:38:48,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:48,099 INFO L93 Difference]: Finished difference Result 2937 states and 5544 transitions. [2024-10-13 23:38:48,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:48,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2024-10-13 23:38:48,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:48,133 INFO L225 Difference]: With dead ends: 2937 [2024-10-13 23:38:48,134 INFO L226 Difference]: Without dead ends: 1898 [2024-10-13 23:38:48,144 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-13 23:38:48,149 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 1009 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 2877 mSolverCounterSat, 560 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 3437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 560 IncrementalHoareTripleChecker+Valid, 2877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:48,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 596 Invalid, 3437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [560 Valid, 2877 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-13 23:38:48,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2024-10-13 23:38:48,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1893. [2024-10-13 23:38:48,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1892 states have (on average 1.73784355179704) internal successors, (3288), 1892 states have internal predecessors, (3288), 0 states have call successors, (0), 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-13 23:38:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 3288 transitions. [2024-10-13 23:38:48,296 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 3288 transitions. Word has length 7 [2024-10-13 23:38:48,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:48,296 INFO L471 AbstractCegarLoop]: Abstraction has 1893 states and 3288 transitions. [2024-10-13 23:38:48,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-13 23:38:48,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 3288 transitions. [2024-10-13 23:38:48,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-13 23:38:48,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:48,299 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 23:38:48,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:38:48,300 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:48,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:48,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1455001935, now seen corresponding path program 1 times [2024-10-13 23:38:48,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:48,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426820962] [2024-10-13 23:38:48,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:48,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:48,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:48,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426820962] [2024-10-13 23:38:48,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426820962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:48,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:48,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:48,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425433041] [2024-10-13 23:38:48,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:48,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:48,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:48,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:48,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:48,621 INFO L87 Difference]: Start difference. First operand 1893 states and 3288 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 2 states have internal predecessors, (72), 0 states have call successors, (0), 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-13 23:38:52,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:52,039 INFO L93 Difference]: Finished difference Result 5383 states and 9440 transitions. [2024-10-13 23:38:52,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:52,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 2 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2024-10-13 23:38:52,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:52,053 INFO L225 Difference]: With dead ends: 5383 [2024-10-13 23:38:52,053 INFO L226 Difference]: Without dead ends: 3491 [2024-10-13 23:38:52,056 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-13 23:38:52,057 INFO L432 NwaCegarLoop]: 858 mSDtfsCounter, 922 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2311 mSolverCounterSat, 879 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 3190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 879 IncrementalHoareTripleChecker+Valid, 2311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:52,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 1011 Invalid, 3190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [879 Valid, 2311 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-13 23:38:52,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3491 states. [2024-10-13 23:38:52,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3491 to 3490. [2024-10-13 23:38:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3490 states, 3489 states have (on average 1.5385497277156779) internal successors, (5368), 3489 states have internal predecessors, (5368), 0 states have call successors, (0), 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-13 23:38:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 5368 transitions. [2024-10-13 23:38:52,127 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 5368 transitions. Word has length 72 [2024-10-13 23:38:52,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:52,128 INFO L471 AbstractCegarLoop]: Abstraction has 3490 states and 5368 transitions. [2024-10-13 23:38:52,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 2 states have internal predecessors, (72), 0 states have call successors, (0), 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-13 23:38:52,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 5368 transitions. [2024-10-13 23:38:52,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-13 23:38:52,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:52,132 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 23:38:52,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:38:52,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:52,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:52,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1708998548, now seen corresponding path program 1 times [2024-10-13 23:38:52,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:52,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695905324] [2024-10-13 23:38:52,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:52,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:52,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:52,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695905324] [2024-10-13 23:38:52,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695905324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:52,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:52,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:52,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671494765] [2024-10-13 23:38:52,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:52,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:52,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:52,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:52,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:52,277 INFO L87 Difference]: Start difference. First operand 3490 states and 5368 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 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-13 23:38:55,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:55,321 INFO L93 Difference]: Finished difference Result 10168 states and 15699 transitions. [2024-10-13 23:38:55,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:55,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-13 23:38:55,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:55,344 INFO L225 Difference]: With dead ends: 10168 [2024-10-13 23:38:55,345 INFO L226 Difference]: Without dead ends: 6679 [2024-10-13 23:38:55,351 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-13 23:38:55,353 INFO L432 NwaCegarLoop]: 712 mSDtfsCounter, 977 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 3309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:55,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 845 Invalid, 3309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-13 23:38:55,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6679 states. [2024-10-13 23:38:55,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6679 to 6668. [2024-10-13 23:38:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6668 states, 6667 states have (on average 1.3752812359382032) internal successors, (9169), 6667 states have internal predecessors, (9169), 0 states have call successors, (0), 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-13 23:38:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6668 states to 6668 states and 9169 transitions. [2024-10-13 23:38:55,504 INFO L78 Accepts]: Start accepts. Automaton has 6668 states and 9169 transitions. Word has length 74 [2024-10-13 23:38:55,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:55,506 INFO L471 AbstractCegarLoop]: Abstraction has 6668 states and 9169 transitions. [2024-10-13 23:38:55,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 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-13 23:38:55,507 INFO L276 IsEmpty]: Start isEmpty. Operand 6668 states and 9169 transitions. [2024-10-13 23:38:55,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-13 23:38:55,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:55,510 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:55,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:38:55,510 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:55,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:55,511 INFO L85 PathProgramCache]: Analyzing trace with hash -162554722, now seen corresponding path program 1 times [2024-10-13 23:38:55,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:55,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656395042] [2024-10-13 23:38:55,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:55,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:55,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:55,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:55,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656395042] [2024-10-13 23:38:55,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656395042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:55,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:55,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:38:55,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641590698] [2024-10-13 23:38:55,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:55,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:55,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:55,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:55,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:55,647 INFO L87 Difference]: Start difference. First operand 6668 states and 9169 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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-13 23:38:58,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:58,921 INFO L93 Difference]: Finished difference Result 19628 states and 27005 transitions. [2024-10-13 23:38:58,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:58,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-10-13 23:38:58,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:58,955 INFO L225 Difference]: With dead ends: 19628 [2024-10-13 23:38:58,955 INFO L226 Difference]: Without dead ends: 12961 [2024-10-13 23:38:58,967 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-13 23:38:58,969 INFO L432 NwaCegarLoop]: 1859 mSDtfsCounter, 926 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 3293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 807 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:58,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 1998 Invalid, 3293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [807 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 23:38:58,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12961 states. [2024-10-13 23:38:59,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12961 to 12956. [2024-10-13 23:38:59,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12956 states, 12955 states have (on average 1.2725588575839444) internal successors, (16486), 12955 states have internal predecessors, (16486), 0 states have call successors, (0), 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-13 23:38:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12956 states to 12956 states and 16486 transitions. [2024-10-13 23:38:59,202 INFO L78 Accepts]: Start accepts. Automaton has 12956 states and 16486 transitions. Word has length 118 [2024-10-13 23:38:59,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:59,204 INFO L471 AbstractCegarLoop]: Abstraction has 12956 states and 16486 transitions. [2024-10-13 23:38:59,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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-13 23:38:59,204 INFO L276 IsEmpty]: Start isEmpty. Operand 12956 states and 16486 transitions. [2024-10-13 23:38:59,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-13 23:38:59,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:59,206 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 23:38:59,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:38:59,207 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:59,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:59,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1533377951, now seen corresponding path program 1 times [2024-10-13 23:38:59,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:59,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93041324] [2024-10-13 23:38:59,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:59,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:59,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:59,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93041324] [2024-10-13 23:38:59,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93041324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:59,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:59,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:59,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222794420] [2024-10-13 23:38:59,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:59,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:59,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:59,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:59,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:59,529 INFO L87 Difference]: Start difference. First operand 12956 states and 16486 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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-13 23:39:02,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:02,433 INFO L93 Difference]: Finished difference Result 22764 states and 29539 transitions. [2024-10-13 23:39:02,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:02,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2024-10-13 23:39:02,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:02,485 INFO L225 Difference]: With dead ends: 22764 [2024-10-13 23:39:02,486 INFO L226 Difference]: Without dead ends: 12178 [2024-10-13 23:39:02,498 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-13 23:39:02,500 INFO L432 NwaCegarLoop]: 1011 mSDtfsCounter, 728 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 2701 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 2705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:02,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1190 Invalid, 2705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2701 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 23:39:02,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12178 states. [2024-10-13 23:39:02,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12178 to 12169. [2024-10-13 23:39:02,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12169 states, 12168 states have (on average 1.2884615384615385) internal successors, (15678), 12168 states have internal predecessors, (15678), 0 states have call successors, (0), 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-13 23:39:02,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12169 states to 12169 states and 15678 transitions. [2024-10-13 23:39:02,740 INFO L78 Accepts]: Start accepts. Automaton has 12169 states and 15678 transitions. Word has length 123 [2024-10-13 23:39:02,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:02,741 INFO L471 AbstractCegarLoop]: Abstraction has 12169 states and 15678 transitions. [2024-10-13 23:39:02,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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-13 23:39:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 12169 states and 15678 transitions. [2024-10-13 23:39:02,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 23:39:02,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:02,748 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:39:02,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:39:02,748 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:02,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:02,749 INFO L85 PathProgramCache]: Analyzing trace with hash 703309834, now seen corresponding path program 1 times [2024-10-13 23:39:02,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:02,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134907884] [2024-10-13 23:39:02,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:02,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:02,953 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 23:39:02,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:02,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134907884] [2024-10-13 23:39:02,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134907884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:02,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:02,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:39:02,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069688956] [2024-10-13 23:39:02,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:02,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:02,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:02,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:02,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:02,958 INFO L87 Difference]: Start difference. First operand 12169 states and 15678 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 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-13 23:39:06,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:06,553 INFO L93 Difference]: Finished difference Result 35375 states and 45655 transitions. [2024-10-13 23:39:06,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:06,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 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 147 [2024-10-13 23:39:06,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:06,595 INFO L225 Difference]: With dead ends: 35375 [2024-10-13 23:39:06,596 INFO L226 Difference]: Without dead ends: 23207 [2024-10-13 23:39:06,612 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-13 23:39:06,614 INFO L432 NwaCegarLoop]: 1088 mSDtfsCounter, 780 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 2535 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 3306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:06,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1234 Invalid, 3306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2535 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-13 23:39:06,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23207 states. [2024-10-13 23:39:06,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23207 to 22403. [2024-10-13 23:39:06,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22403 states, 22402 states have (on average 1.193420230336577) internal successors, (26735), 22402 states have internal predecessors, (26735), 0 states have call successors, (0), 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-13 23:39:06,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22403 states to 22403 states and 26735 transitions. [2024-10-13 23:39:06,898 INFO L78 Accepts]: Start accepts. Automaton has 22403 states and 26735 transitions. Word has length 147 [2024-10-13 23:39:06,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:06,898 INFO L471 AbstractCegarLoop]: Abstraction has 22403 states and 26735 transitions. [2024-10-13 23:39:06,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 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-13 23:39:06,899 INFO L276 IsEmpty]: Start isEmpty. Operand 22403 states and 26735 transitions. [2024-10-13 23:39:06,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-13 23:39:06,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:06,904 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 23:39:06,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:39:06,904 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:06,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:06,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1008948292, now seen corresponding path program 1 times [2024-10-13 23:39:06,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:06,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449510424] [2024-10-13 23:39:06,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:06,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:07,288 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-10-13 23:39:07,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:07,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449510424] [2024-10-13 23:39:07,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449510424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:07,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:07,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:39:07,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523596673] [2024-10-13 23:39:07,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:07,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:07,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:07,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:07,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:07,292 INFO L87 Difference]: Start difference. First operand 22403 states and 26735 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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-13 23:39:09,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:09,899 INFO L93 Difference]: Finished difference Result 44018 states and 52672 transitions. [2024-10-13 23:39:09,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:09,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 236 [2024-10-13 23:39:09,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:09,933 INFO L225 Difference]: With dead ends: 44018 [2024-10-13 23:39:09,933 INFO L226 Difference]: Without dead ends: 22403 [2024-10-13 23:39:09,955 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-13 23:39:09,957 INFO L432 NwaCegarLoop]: 1065 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 2509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:09,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1194 Invalid, 2509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 23:39:09,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22403 states. [2024-10-13 23:39:10,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22403 to 22403. [2024-10-13 23:39:10,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22403 states, 22402 states have (on average 1.1931970359789303) internal successors, (26730), 22402 states have internal predecessors, (26730), 0 states have call successors, (0), 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-13 23:39:10,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22403 states to 22403 states and 26730 transitions. [2024-10-13 23:39:10,237 INFO L78 Accepts]: Start accepts. Automaton has 22403 states and 26730 transitions. Word has length 236 [2024-10-13 23:39:10,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:10,237 INFO L471 AbstractCegarLoop]: Abstraction has 22403 states and 26730 transitions. [2024-10-13 23:39:10,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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-13 23:39:10,238 INFO L276 IsEmpty]: Start isEmpty. Operand 22403 states and 26730 transitions. [2024-10-13 23:39:10,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-10-13 23:39:10,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:10,242 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 23:39:10,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:39:10,242 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:10,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:10,243 INFO L85 PathProgramCache]: Analyzing trace with hash -547367669, now seen corresponding path program 1 times [2024-10-13 23:39:10,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:10,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040580531] [2024-10-13 23:39:10,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:10,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 23:39:10,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:10,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040580531] [2024-10-13 23:39:10,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040580531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:10,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:10,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:39:10,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584372723] [2024-10-13 23:39:10,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:10,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:10,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:10,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:10,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:10,424 INFO L87 Difference]: Start difference. First operand 22403 states and 26730 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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-13 23:39:13,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:13,484 INFO L93 Difference]: Finished difference Result 55045 states and 66947 transitions. [2024-10-13 23:39:13,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:13,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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 243 [2024-10-13 23:39:13,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:13,525 INFO L225 Difference]: With dead ends: 55045 [2024-10-13 23:39:13,525 INFO L226 Difference]: Without dead ends: 33430 [2024-10-13 23:39:13,548 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-13 23:39:13,549 INFO L432 NwaCegarLoop]: 808 mSDtfsCounter, 881 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 903 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 3288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 903 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:13,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 926 Invalid, 3288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [903 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 23:39:13,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33430 states. [2024-10-13 23:39:13,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33430 to 32634. [2024-10-13 23:39:14,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32634 states, 32633 states have (on average 1.1761407164526707) internal successors, (38381), 32633 states have internal predecessors, (38381), 0 states have call successors, (0), 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-13 23:39:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32634 states to 32634 states and 38381 transitions. [2024-10-13 23:39:14,062 INFO L78 Accepts]: Start accepts. Automaton has 32634 states and 38381 transitions. Word has length 243 [2024-10-13 23:39:14,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:14,063 INFO L471 AbstractCegarLoop]: Abstraction has 32634 states and 38381 transitions. [2024-10-13 23:39:14,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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-13 23:39:14,063 INFO L276 IsEmpty]: Start isEmpty. Operand 32634 states and 38381 transitions. [2024-10-13 23:39:14,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-10-13 23:39:14,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:14,067 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:39:14,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:39:14,068 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:14,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:14,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1969773675, now seen corresponding path program 1 times [2024-10-13 23:39:14,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:14,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035971220] [2024-10-13 23:39:14,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:14,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:14,290 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-13 23:39:14,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:14,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035971220] [2024-10-13 23:39:14,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035971220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:14,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:14,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:39:14,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841401049] [2024-10-13 23:39:14,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:14,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:14,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:14,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:14,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:14,293 INFO L87 Difference]: Start difference. First operand 32634 states and 38381 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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-13 23:39:17,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:17,673 INFO L93 Difference]: Finished difference Result 76293 states and 91192 transitions. [2024-10-13 23:39:17,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:17,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 298 [2024-10-13 23:39:17,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:17,724 INFO L225 Difference]: With dead ends: 76293 [2024-10-13 23:39:17,724 INFO L226 Difference]: Without dead ends: 44447 [2024-10-13 23:39:17,750 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-13 23:39:17,751 INFO L432 NwaCegarLoop]: 1804 mSDtfsCounter, 856 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2551 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 3274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 2551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:17,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 1947 Invalid, 3274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 2551 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 23:39:17,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44447 states. [2024-10-13 23:39:18,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44447 to 43656. [2024-10-13 23:39:18,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43656 states, 43655 states have (on average 1.1516664757759707) internal successors, (50276), 43655 states have internal predecessors, (50276), 0 states have call successors, (0), 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-13 23:39:18,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43656 states to 43656 states and 50276 transitions. [2024-10-13 23:39:18,243 INFO L78 Accepts]: Start accepts. Automaton has 43656 states and 50276 transitions. Word has length 298 [2024-10-13 23:39:18,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:18,245 INFO L471 AbstractCegarLoop]: Abstraction has 43656 states and 50276 transitions. [2024-10-13 23:39:18,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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-13 23:39:18,245 INFO L276 IsEmpty]: Start isEmpty. Operand 43656 states and 50276 transitions. [2024-10-13 23:39:18,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-10-13 23:39:18,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:18,250 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:39:18,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:39:18,250 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:18,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:18,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1348846708, now seen corresponding path program 1 times [2024-10-13 23:39:18,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:18,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962300839] [2024-10-13 23:39:18,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:18,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:19,751 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 140 proven. 113 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 23:39:19,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:19,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962300839] [2024-10-13 23:39:19,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962300839] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:39:19,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014611197] [2024-10-13 23:39:19,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:19,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:39:19,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:39:19,755 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-13 23:39:19,757 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-13 23:39:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:20,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:39:20,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:39:20,196 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-13 23:39:20,197 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:39:20,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014611197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:20,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:39:20,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-13 23:39:20,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626845732] [2024-10-13 23:39:20,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:20,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:20,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:20,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:20,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 23:39:20,202 INFO L87 Difference]: Start difference. First operand 43656 states and 50276 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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-13 23:39:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:23,376 INFO L93 Difference]: Finished difference Result 86515 states and 99751 transitions. [2024-10-13 23:39:23,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:23,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 313 [2024-10-13 23:39:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:23,440 INFO L225 Difference]: With dead ends: 86515 [2024-10-13 23:39:23,440 INFO L226 Difference]: Without dead ends: 43647 [2024-10-13 23:39:23,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 23:39:23,471 INFO L432 NwaCegarLoop]: 687 mSDtfsCounter, 1075 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 2923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:23,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 816 Invalid, 2923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2396 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 23:39:23,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43647 states. [2024-10-13 23:39:23,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43647 to 43646. [2024-10-13 23:39:23,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43646 states, 43645 states have (on average 1.1132775804788635) internal successors, (48589), 43645 states have internal predecessors, (48589), 0 states have call successors, (0), 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-13 23:39:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43646 states to 43646 states and 48589 transitions. [2024-10-13 23:39:23,862 INFO L78 Accepts]: Start accepts. Automaton has 43646 states and 48589 transitions. Word has length 313 [2024-10-13 23:39:23,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:23,863 INFO L471 AbstractCegarLoop]: Abstraction has 43646 states and 48589 transitions. [2024-10-13 23:39:23,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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-13 23:39:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 43646 states and 48589 transitions. [2024-10-13 23:39:23,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-10-13 23:39:23,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:23,869 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 23:39:23,891 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-13 23:39:24,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-13 23:39:24,070 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:24,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:24,071 INFO L85 PathProgramCache]: Analyzing trace with hash -5987741, now seen corresponding path program 1 times [2024-10-13 23:39:24,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:24,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187603184] [2024-10-13 23:39:24,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:24,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:24,644 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2024-10-13 23:39:24,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:24,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187603184] [2024-10-13 23:39:24,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187603184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:24,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:24,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:39:24,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427985783] [2024-10-13 23:39:24,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:24,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:24,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:24,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:24,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:24,647 INFO L87 Difference]: Start difference. First operand 43646 states and 48589 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:27,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:27,347 INFO L93 Difference]: Finished difference Result 86502 states and 96384 transitions. [2024-10-13 23:39:27,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:27,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 332 [2024-10-13 23:39:27,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:27,389 INFO L225 Difference]: With dead ends: 86502 [2024-10-13 23:39:27,389 INFO L226 Difference]: Without dead ends: 43644 [2024-10-13 23:39:27,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-13 23:39:27,414 INFO L432 NwaCegarLoop]: 1340 mSDtfsCounter, 1194 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2464 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 2908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:27,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 1418 Invalid, 2908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2464 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 23:39:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43644 states. [2024-10-13 23:39:27,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43644 to 43643. [2024-10-13 23:39:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43643 states, 43642 states have (on average 1.0865908986755877) internal successors, (47421), 43642 states have internal predecessors, (47421), 0 states have call successors, (0), 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-13 23:39:27,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43643 states to 43643 states and 47421 transitions. [2024-10-13 23:39:27,896 INFO L78 Accepts]: Start accepts. Automaton has 43643 states and 47421 transitions. Word has length 332 [2024-10-13 23:39:27,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:27,897 INFO L471 AbstractCegarLoop]: Abstraction has 43643 states and 47421 transitions. [2024-10-13 23:39:27,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:27,897 INFO L276 IsEmpty]: Start isEmpty. Operand 43643 states and 47421 transitions. [2024-10-13 23:39:27,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-10-13 23:39:27,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:27,903 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 23:39:27,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:39:27,903 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:27,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:27,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1403559186, now seen corresponding path program 1 times [2024-10-13 23:39:27,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:27,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56316340] [2024-10-13 23:39:27,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:27,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-13 23:39:28,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:28,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56316340] [2024-10-13 23:39:28,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56316340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:28,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:28,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:39:28,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903921430] [2024-10-13 23:39:28,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:28,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:39:28,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:28,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:39:28,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:39:28,220 INFO L87 Difference]: Start difference. First operand 43643 states and 47421 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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-13 23:39:34,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:34,412 INFO L93 Difference]: Finished difference Result 150459 states and 163809 transitions. [2024-10-13 23:39:34,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:39:34,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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 355 [2024-10-13 23:39:34,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:34,524 INFO L225 Difference]: With dead ends: 150459 [2024-10-13 23:39:34,524 INFO L226 Difference]: Without dead ends: 107604 [2024-10-13 23:39:34,551 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-13 23:39:34,551 INFO L432 NwaCegarLoop]: 564 mSDtfsCounter, 1704 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 6637 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1704 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 7671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 6637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:34,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1704 Valid, 801 Invalid, 7671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 6637 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-10-13 23:39:34,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107604 states. [2024-10-13 23:39:35,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107604 to 104325. [2024-10-13 23:39:35,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104325 states, 104324 states have (on average 1.0794352210421378) internal successors, (112611), 104324 states have internal predecessors, (112611), 0 states have call successors, (0), 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-13 23:39:36,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104325 states to 104325 states and 112611 transitions. [2024-10-13 23:39:36,111 INFO L78 Accepts]: Start accepts. Automaton has 104325 states and 112611 transitions. Word has length 355 [2024-10-13 23:39:36,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:36,111 INFO L471 AbstractCegarLoop]: Abstraction has 104325 states and 112611 transitions. [2024-10-13 23:39:36,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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-13 23:39:36,112 INFO L276 IsEmpty]: Start isEmpty. Operand 104325 states and 112611 transitions. [2024-10-13 23:39:36,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2024-10-13 23:39:36,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:36,126 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2024-10-13 23:39:36,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:39:36,127 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:36,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:36,127 INFO L85 PathProgramCache]: Analyzing trace with hash 170625098, now seen corresponding path program 1 times [2024-10-13 23:39:36,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:36,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424612181] [2024-10-13 23:39:36,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:36,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 312 proven. 110 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-13 23:39:37,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:37,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424612181] [2024-10-13 23:39:37,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424612181] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:39:37,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228632574] [2024-10-13 23:39:37,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:37,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:39:37,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:39:37,291 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-13 23:39:37,293 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-13 23:39:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:37,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:39:37,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:39:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2024-10-13 23:39:37,496 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:39:37,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228632574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:37,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:39:37,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-13 23:39:37,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705532686] [2024-10-13 23:39:37,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:37,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:37,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:37,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:37,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:39:37,499 INFO L87 Difference]: Start difference. First operand 104325 states and 112611 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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-13 23:39:41,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:41,219 INFO L93 Difference]: Finished difference Result 233051 states and 253447 transitions. [2024-10-13 23:39:41,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:41,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 398 [2024-10-13 23:39:41,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:41,379 INFO L225 Difference]: With dead ends: 233051 [2024-10-13 23:39:41,379 INFO L226 Difference]: Without dead ends: 129514 [2024-10-13 23:39:41,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:39:41,622 INFO L432 NwaCegarLoop]: 796 mSDtfsCounter, 980 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2416 mSolverCounterSat, 939 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 3355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 939 IncrementalHoareTripleChecker+Valid, 2416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:41,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 878 Invalid, 3355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [939 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-13 23:39:41,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129514 states. [2024-10-13 23:39:42,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129514 to 127921. [2024-10-13 23:39:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127921 states, 127920 states have (on average 1.0841932457786116) internal successors, (138690), 127920 states have internal predecessors, (138690), 0 states have call successors, (0), 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-13 23:39:43,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127921 states to 127921 states and 138690 transitions. [2024-10-13 23:39:43,361 INFO L78 Accepts]: Start accepts. Automaton has 127921 states and 138690 transitions. Word has length 398 [2024-10-13 23:39:43,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:43,362 INFO L471 AbstractCegarLoop]: Abstraction has 127921 states and 138690 transitions. [2024-10-13 23:39:43,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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-13 23:39:43,362 INFO L276 IsEmpty]: Start isEmpty. Operand 127921 states and 138690 transitions. [2024-10-13 23:39:43,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2024-10-13 23:39:43,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:43,379 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:39:43,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 23:39:43,583 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,SelfDestructingSolverStorable12 [2024-10-13 23:39:43,584 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:43,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:43,585 INFO L85 PathProgramCache]: Analyzing trace with hash 918814596, now seen corresponding path program 1 times [2024-10-13 23:39:43,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:43,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625357584] [2024-10-13 23:39:43,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:43,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:44,278 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-10-13 23:39:44,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:44,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625357584] [2024-10-13 23:39:44,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625357584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:44,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:44,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:39:44,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517905556] [2024-10-13 23:39:44,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:44,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:44,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:44,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:44,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:44,281 INFO L87 Difference]: Start difference. First operand 127921 states and 138690 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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-13 23:39:47,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:47,549 INFO L93 Difference]: Finished difference Result 256632 states and 278179 transitions. [2024-10-13 23:39:47,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:47,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 467 [2024-10-13 23:39:47,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:47,706 INFO L225 Difference]: With dead ends: 256632 [2024-10-13 23:39:47,706 INFO L226 Difference]: Without dead ends: 129499 [2024-10-13 23:39:47,764 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-13 23:39:47,764 INFO L432 NwaCegarLoop]: 1383 mSDtfsCounter, 835 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 3092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 607 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:47,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1467 Invalid, 3092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [607 Valid, 2485 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 23:39:47,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129499 states. [2024-10-13 23:39:49,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129499 to 127910. [2024-10-13 23:39:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127910 states, 127909 states have (on average 1.0648977007090978) internal successors, (136210), 127909 states have internal predecessors, (136210), 0 states have call successors, (0), 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-13 23:39:49,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127910 states to 127910 states and 136210 transitions. [2024-10-13 23:39:49,392 INFO L78 Accepts]: Start accepts. Automaton has 127910 states and 136210 transitions. Word has length 467 [2024-10-13 23:39:49,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:49,392 INFO L471 AbstractCegarLoop]: Abstraction has 127910 states and 136210 transitions. [2024-10-13 23:39:49,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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-13 23:39:49,393 INFO L276 IsEmpty]: Start isEmpty. Operand 127910 states and 136210 transitions. [2024-10-13 23:39:49,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2024-10-13 23:39:49,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:49,404 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:39:49,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 23:39:49,405 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:49,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:49,405 INFO L85 PathProgramCache]: Analyzing trace with hash 432516631, now seen corresponding path program 1 times [2024-10-13 23:39:49,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:49,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618312548] [2024-10-13 23:39:49,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:49,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat