./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_label57.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label57.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 606add1ed9f1e0586ce8d6fd9687905298c8e4323967309eabbf0457b8710a5c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:31:43,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:31:43,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:31:43,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:31:43,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:31:43,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:31:43,367 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:31:43,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:31:43,367 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:31:43,368 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:31:43,368 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:31:43,370 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:31:43,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:31:43,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:31:43,371 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:31:43,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:31:43,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:31:43,372 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:31:43,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:31:43,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:31:43,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:31:43,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:31:43,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:31:43,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:31:43,378 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:31:43,378 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:31:43,378 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:31:43,378 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:31:43,378 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:31:43,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:31:43,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:31:43,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:31:43,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:31:43,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:31:43,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:31:43,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:31:43,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:31:43,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:31:43,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:31:43,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:31:43,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:31:43,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:31:43,382 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-clean/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-clean/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 -> 606add1ed9f1e0586ce8d6fd9687905298c8e4323967309eabbf0457b8710a5c [2024-10-10 23:31:43,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:31:43,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:31:43,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:31:43,625 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:31:43,625 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:31:43,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label57.c [2024-10-10 23:31:45,097 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:31:45,523 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:31:45,525 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label57.c [2024-10-10 23:31:45,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/61ce97141/18ff5830645345f6b6c323ac69c1358f/FLAG50f9b218d [2024-10-10 23:31:45,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/61ce97141/18ff5830645345f6b6c323ac69c1358f [2024-10-10 23:31:45,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:31:45,603 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:31:45,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:31:45,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:31:45,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:31:45,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:31:45" (1/1) ... [2024-10-10 23:31:45,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13941058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:45, skipping insertion in model container [2024-10-10 23:31:45,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:31:45" (1/1) ... [2024-10-10 23:31:45,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:31:46,016 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_label57.c[8676,8689] [2024-10-10 23:31:46,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:31:46,742 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:31:46,769 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_label57.c[8676,8689] [2024-10-10 23:31:47,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:31:47,196 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:31:47,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:47 WrapperNode [2024-10-10 23:31:47,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:31:47,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:31:47,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:31:47,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:31:47,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:47" (1/1) ... [2024-10-10 23:31:47,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:47" (1/1) ... [2024-10-10 23:31:47,851 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-10 23:31:47,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:31:47,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:31:47,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:31:47,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:31:47,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:47" (1/1) ... [2024-10-10 23:31:47,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:47" (1/1) ... [2024-10-10 23:31:48,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:47" (1/1) ... [2024-10-10 23:31:48,330 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-10 23:31:48,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:47" (1/1) ... [2024-10-10 23:31:48,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:47" (1/1) ... [2024-10-10 23:31:48,619 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:47" (1/1) ... [2024-10-10 23:31:48,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:47" (1/1) ... [2024-10-10 23:31:48,695 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:47" (1/1) ... [2024-10-10 23:31:48,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:47" (1/1) ... [2024-10-10 23:31:48,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:31:48,793 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:31:48,794 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:31:48,794 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:31:48,795 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:47" (1/1) ... [2024-10-10 23:31:48,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:31:48,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:31:48,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:31:48,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:31:48,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:31:48,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:31:48,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:31:48,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:31:49,044 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:31:49,046 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:31:53,171 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-10 23:31:53,171 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:31:53,240 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:31:53,240 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:31:53,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:31:53 BoogieIcfgContainer [2024-10-10 23:31:53,241 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:31:53,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:31:53,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:31:53,244 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:31:53,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:31:45" (1/3) ... [2024-10-10 23:31:53,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c97803d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:31:53, skipping insertion in model container [2024-10-10 23:31:53,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:47" (2/3) ... [2024-10-10 23:31:53,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c97803d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:31:53, skipping insertion in model container [2024-10-10 23:31:53,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:31:53" (3/3) ... [2024-10-10 23:31:53,246 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label57.c [2024-10-10 23:31:53,258 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:31:53,259 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:31:53,320 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:31:53,325 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;@7b40a88e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:31:53,325 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:31:53,333 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-10 23:31:53,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-10 23:31:53,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:53,340 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:31:53,341 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:53,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:53,345 INFO L85 PathProgramCache]: Analyzing trace with hash 20021903, now seen corresponding path program 1 times [2024-10-10 23:31:53,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:53,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747877555] [2024-10-10 23:31:53,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:53,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:53,479 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-10 23:31:53,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:53,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747877555] [2024-10-10 23:31:53,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747877555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:53,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:31:53,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:31:53,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212603510] [2024-10-10 23:31:53,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:53,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:31:53,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:53,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:31:53,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:31:53,511 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 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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-10 23:31:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:31:53,583 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-10 23:31:53,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:31:53,586 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-10-10 23:31:53,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:31:53,600 INFO L225 Difference]: With dead ends: 2071 [2024-10-10 23:31:53,600 INFO L226 Difference]: Without dead ends: 1034 [2024-10-10 23:31:53,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:31:53,607 INFO L432 NwaCegarLoop]: 1876 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:31:53,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1876 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:31:53,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-10 23:31:53,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-10 23:31:53,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 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-10 23:31:53,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-10 23:31:53,789 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 60 [2024-10-10 23:31:53,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:31:53,790 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-10 23:31:53,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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-10 23:31:53,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-10 23:31:53,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-10 23:31:53,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:53,791 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:31:53,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:31:53,792 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:53,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:53,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1581633312, now seen corresponding path program 1 times [2024-10-10 23:31:53,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:53,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478282617] [2024-10-10 23:31:53,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:53,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:53,988 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-10 23:31:53,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:53,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478282617] [2024-10-10 23:31:53,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478282617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:53,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:31:53,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:31:53,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719660270] [2024-10-10 23:31:53,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:53,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:31:53,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:53,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:31:53,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:31:53,992 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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-10 23:31:57,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:31:57,171 INFO L93 Difference]: Finished difference Result 2905 states and 5325 transitions. [2024-10-10 23:31:57,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:31:57,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-10-10 23:31:57,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:31:57,180 INFO L225 Difference]: With dead ends: 2905 [2024-10-10 23:31:57,180 INFO L226 Difference]: Without dead ends: 1872 [2024-10-10 23:31:57,182 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-10 23:31:57,182 INFO L432 NwaCegarLoop]: 939 mSDtfsCounter, 828 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2446 mSolverCounterSat, 798 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 3244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 798 IncrementalHoareTripleChecker+Valid, 2446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:31:57,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 1090 Invalid, 3244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [798 Valid, 2446 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:31:57,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2024-10-10 23:31:57,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1858. [2024-10-10 23:31:57,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1857 states have (on average 1.5444264943457189) internal successors, (2868), 1857 states have internal predecessors, (2868), 0 states have call successors, (0), 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-10 23:31:57,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2868 transitions. [2024-10-10 23:31:57,245 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2868 transitions. Word has length 60 [2024-10-10 23:31:57,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:31:57,247 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2868 transitions. [2024-10-10 23:31:57,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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-10 23:31:57,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2868 transitions. [2024-10-10 23:31:57,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-10 23:31:57,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:57,251 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:31:57,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:31:57,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:57,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:57,252 INFO L85 PathProgramCache]: Analyzing trace with hash -619896076, now seen corresponding path program 1 times [2024-10-10 23:31:57,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:57,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401164981] [2024-10-10 23:31:57,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:57,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:31:57,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:57,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401164981] [2024-10-10 23:31:57,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401164981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:57,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:31:57,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:31:57,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322960612] [2024-10-10 23:31:57,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:57,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:31:57,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:57,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:31:57,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:31:57,429 INFO L87 Difference]: Start difference. First operand 1858 states and 2868 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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-10 23:32:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:00,867 INFO L93 Difference]: Finished difference Result 5316 states and 8228 transitions. [2024-10-10 23:32:00,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:00,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2024-10-10 23:32:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:00,878 INFO L225 Difference]: With dead ends: 5316 [2024-10-10 23:32:00,878 INFO L226 Difference]: Without dead ends: 3459 [2024-10-10 23:32:00,881 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-10 23:32:00,881 INFO L432 NwaCegarLoop]: 1037 mSDtfsCounter, 826 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2403 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 3280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:00,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1190 Invalid, 3280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2403 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-10 23:32:00,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3459 states. [2024-10-10 23:32:00,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3459 to 3458. [2024-10-10 23:32:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3458 states, 3457 states have (on average 1.380676887474689) internal successors, (4773), 3457 states have internal predecessors, (4773), 0 states have call successors, (0), 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-10 23:32:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 3458 states and 4773 transitions. [2024-10-10 23:32:00,982 INFO L78 Accepts]: Start accepts. Automaton has 3458 states and 4773 transitions. Word has length 132 [2024-10-10 23:32:00,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:00,983 INFO L471 AbstractCegarLoop]: Abstraction has 3458 states and 4773 transitions. [2024-10-10 23:32:00,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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-10 23:32:00,985 INFO L276 IsEmpty]: Start isEmpty. Operand 3458 states and 4773 transitions. [2024-10-10 23:32:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-10 23:32:00,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:00,991 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:32:00,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:32:00,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:00,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:00,992 INFO L85 PathProgramCache]: Analyzing trace with hash 2145908957, now seen corresponding path program 1 times [2024-10-10 23:32:00,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:00,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462250757] [2024-10-10 23:32:00,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:00,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:32:01,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:01,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462250757] [2024-10-10 23:32:01,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462250757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:01,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:01,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:32:01,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642675752] [2024-10-10 23:32:01,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:01,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:32:01,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:01,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:32:01,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:32:01,379 INFO L87 Difference]: Start difference. First operand 3458 states and 4773 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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-10 23:32:05,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:05,877 INFO L93 Difference]: Finished difference Result 10869 states and 14767 transitions. [2024-10-10 23:32:05,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:32:05,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2024-10-10 23:32:05,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:05,913 INFO L225 Difference]: With dead ends: 10869 [2024-10-10 23:32:05,914 INFO L226 Difference]: Without dead ends: 7412 [2024-10-10 23:32:05,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:32:05,927 INFO L432 NwaCegarLoop]: 707 mSDtfsCounter, 2581 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 4118 mSolverCounterSat, 831 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2581 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 4949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 831 IncrementalHoareTripleChecker+Valid, 4118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:05,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2581 Valid, 1001 Invalid, 4949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [831 Valid, 4118 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-10 23:32:05,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7412 states. [2024-10-10 23:32:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7412 to 7411. [2024-10-10 23:32:06,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7411 states, 7410 states have (on average 1.269905533063428) internal successors, (9410), 7410 states have internal predecessors, (9410), 0 states have call successors, (0), 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-10 23:32:06,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7411 states to 7411 states and 9410 transitions. [2024-10-10 23:32:06,049 INFO L78 Accepts]: Start accepts. Automaton has 7411 states and 9410 transitions. Word has length 146 [2024-10-10 23:32:06,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:06,050 INFO L471 AbstractCegarLoop]: Abstraction has 7411 states and 9410 transitions. [2024-10-10 23:32:06,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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-10 23:32:06,051 INFO L276 IsEmpty]: Start isEmpty. Operand 7411 states and 9410 transitions. [2024-10-10 23:32:06,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-10-10 23:32:06,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:06,059 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:32:06,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:32:06,060 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:06,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:06,060 INFO L85 PathProgramCache]: Analyzing trace with hash -735546500, now seen corresponding path program 1 times [2024-10-10 23:32:06,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:06,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416897381] [2024-10-10 23:32:06,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:06,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-10 23:32:06,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:06,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416897381] [2024-10-10 23:32:06,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416897381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:06,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:06,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:32:06,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441219798] [2024-10-10 23:32:06,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:06,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:06,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:06,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:06,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:32:06,291 INFO L87 Difference]: Start difference. First operand 7411 states and 9410 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 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-10 23:32:09,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:09,430 INFO L93 Difference]: Finished difference Result 20356 states and 26251 transitions. [2024-10-10 23:32:09,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:09,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 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 227 [2024-10-10 23:32:09,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:09,465 INFO L225 Difference]: With dead ends: 20356 [2024-10-10 23:32:09,465 INFO L226 Difference]: Without dead ends: 13733 [2024-10-10 23:32:09,476 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-10 23:32:09,477 INFO L432 NwaCegarLoop]: 849 mSDtfsCounter, 889 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2577 mSolverCounterSat, 747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 3324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 747 IncrementalHoareTripleChecker+Valid, 2577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:09,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 978 Invalid, 3324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [747 Valid, 2577 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-10 23:32:09,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13733 states. [2024-10-10 23:32:09,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13733 to 12936. [2024-10-10 23:32:09,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12936 states, 12935 states have (on average 1.2152299961345188) internal successors, (15719), 12935 states have internal predecessors, (15719), 0 states have call successors, (0), 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-10 23:32:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12936 states to 12936 states and 15719 transitions. [2024-10-10 23:32:09,654 INFO L78 Accepts]: Start accepts. Automaton has 12936 states and 15719 transitions. Word has length 227 [2024-10-10 23:32:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:09,654 INFO L471 AbstractCegarLoop]: Abstraction has 12936 states and 15719 transitions. [2024-10-10 23:32:09,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 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-10 23:32:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 12936 states and 15719 transitions. [2024-10-10 23:32:09,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-10-10 23:32:09,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:09,658 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:32:09,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:32:09,659 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:09,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:09,659 INFO L85 PathProgramCache]: Analyzing trace with hash 546602188, now seen corresponding path program 1 times [2024-10-10 23:32:09,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:09,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739624702] [2024-10-10 23:32:09,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:09,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:32:09,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:09,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739624702] [2024-10-10 23:32:09,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739624702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:09,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:09,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:32:09,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443080708] [2024-10-10 23:32:09,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:09,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:09,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:09,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:09,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:32:09,837 INFO L87 Difference]: Start difference. First operand 12936 states and 15719 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 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-10 23:32:12,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:12,872 INFO L93 Difference]: Finished difference Result 31391 states and 39118 transitions. [2024-10-10 23:32:12,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:12,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 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 259 [2024-10-10 23:32:12,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:12,912 INFO L225 Difference]: With dead ends: 31391 [2024-10-10 23:32:12,916 INFO L226 Difference]: Without dead ends: 19243 [2024-10-10 23:32:12,945 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-10 23:32:12,946 INFO L432 NwaCegarLoop]: 807 mSDtfsCounter, 857 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 914 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 3296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 914 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:12,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 924 Invalid, 3296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [914 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-10 23:32:12,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19243 states. [2024-10-10 23:32:13,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19243 to 18446. [2024-10-10 23:32:13,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18446 states, 18445 states have (on average 1.20243968555164) internal successors, (22179), 18445 states have internal predecessors, (22179), 0 states have call successors, (0), 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-10 23:32:13,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18446 states to 18446 states and 22179 transitions. [2024-10-10 23:32:13,251 INFO L78 Accepts]: Start accepts. Automaton has 18446 states and 22179 transitions. Word has length 259 [2024-10-10 23:32:13,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:13,252 INFO L471 AbstractCegarLoop]: Abstraction has 18446 states and 22179 transitions. [2024-10-10 23:32:13,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 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-10 23:32:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 18446 states and 22179 transitions. [2024-10-10 23:32:13,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-10-10 23:32:13,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:13,257 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:32:13,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:32:13,257 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:13,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:13,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2067343745, now seen corresponding path program 1 times [2024-10-10 23:32:13,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:13,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756393107] [2024-10-10 23:32:13,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:13,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:13,747 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-10 23:32:13,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:13,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756393107] [2024-10-10 23:32:13,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756393107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:13,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:13,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:32:13,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790178816] [2024-10-10 23:32:13,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:13,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:32:13,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:13,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:32:13,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:32:13,750 INFO L87 Difference]: Start difference. First operand 18446 states and 22179 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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-10 23:32:18,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:18,880 INFO L93 Difference]: Finished difference Result 59762 states and 73268 transitions. [2024-10-10 23:32:18,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:32:18,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 348 [2024-10-10 23:32:18,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:18,945 INFO L225 Difference]: With dead ends: 59762 [2024-10-10 23:32:18,945 INFO L226 Difference]: Without dead ends: 42104 [2024-10-10 23:32:18,970 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-10 23:32:18,972 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 1613 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 5345 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1613 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 6221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 5345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:18,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1613 Valid, 914 Invalid, 6221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 5345 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-10-10 23:32:19,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42104 states. [2024-10-10 23:32:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42104 to 42100. [2024-10-10 23:32:19,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42100 states, 42099 states have (on average 1.1870353215040736) internal successors, (49973), 42099 states have internal predecessors, (49973), 0 states have call successors, (0), 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-10 23:32:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42100 states to 42100 states and 49973 transitions. [2024-10-10 23:32:19,524 INFO L78 Accepts]: Start accepts. Automaton has 42100 states and 49973 transitions. Word has length 348 [2024-10-10 23:32:19,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:19,525 INFO L471 AbstractCegarLoop]: Abstraction has 42100 states and 49973 transitions. [2024-10-10 23:32:19,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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-10 23:32:19,525 INFO L276 IsEmpty]: Start isEmpty. Operand 42100 states and 49973 transitions. [2024-10-10 23:32:19,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-10-10 23:32:19,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:19,531 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:32:19,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:32:19,532 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:19,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:19,532 INFO L85 PathProgramCache]: Analyzing trace with hash 253479429, now seen corresponding path program 1 times [2024-10-10 23:32:19,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:19,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643461864] [2024-10-10 23:32:19,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:19,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-10 23:32:19,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:19,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643461864] [2024-10-10 23:32:19,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643461864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:19,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:19,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:32:19,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956098822] [2024-10-10 23:32:19,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:19,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:32:19,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:19,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:32:19,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:32:19,732 INFO L87 Difference]: Start difference. First operand 42100 states and 49973 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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-10 23:32:26,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:26,585 INFO L93 Difference]: Finished difference Result 142667 states and 170389 transitions. [2024-10-10 23:32:26,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:32:26,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 348 [2024-10-10 23:32:26,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:26,733 INFO L225 Difference]: With dead ends: 142667 [2024-10-10 23:32:26,734 INFO L226 Difference]: Without dead ends: 101355 [2024-10-10 23:32:26,766 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-10 23:32:26,768 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 1738 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 6066 mSolverCounterSat, 1187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 7253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1187 IncrementalHoareTripleChecker+Valid, 6066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:26,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1738 Valid, 686 Invalid, 7253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1187 Valid, 6066 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-10-10 23:32:26,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101355 states. [2024-10-10 23:32:28,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101355 to 100435. [2024-10-10 23:32:28,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100435 states, 100434 states have (on average 1.1702112830316427) internal successors, (117529), 100434 states have internal predecessors, (117529), 0 states have call successors, (0), 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-10 23:32:28,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100435 states to 100435 states and 117529 transitions. [2024-10-10 23:32:28,558 INFO L78 Accepts]: Start accepts. Automaton has 100435 states and 117529 transitions. Word has length 348 [2024-10-10 23:32:28,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:28,559 INFO L471 AbstractCegarLoop]: Abstraction has 100435 states and 117529 transitions. [2024-10-10 23:32:28,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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-10 23:32:28,559 INFO L276 IsEmpty]: Start isEmpty. Operand 100435 states and 117529 transitions. [2024-10-10 23:32:28,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2024-10-10 23:32:28,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:28,702 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:32:28,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:32:28,703 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:28,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:28,703 INFO L85 PathProgramCache]: Analyzing trace with hash 630181348, now seen corresponding path program 1 times [2024-10-10 23:32:28,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:28,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591848514] [2024-10-10 23:32:28,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:28,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:29,035 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-10-10 23:32:29,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:29,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591848514] [2024-10-10 23:32:29,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591848514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:29,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:29,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:32:29,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224288390] [2024-10-10 23:32:29,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:29,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:29,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:29,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:29,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:32:29,042 INFO L87 Difference]: Start difference. First operand 100435 states and 117529 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:32,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:32,278 INFO L93 Difference]: Finished difference Result 189848 states and 223217 transitions. [2024-10-10 23:32:32,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:32,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 357 [2024-10-10 23:32:32,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:32,423 INFO L225 Difference]: With dead ends: 189848 [2024-10-10 23:32:32,423 INFO L226 Difference]: Without dead ends: 100445 [2024-10-10 23:32:32,461 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-10 23:32:32,463 INFO L432 NwaCegarLoop]: 1018 mSDtfsCounter, 730 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 2706 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 2710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:32,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1199 Invalid, 2710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2706 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:32:32,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100445 states. [2024-10-10 23:32:33,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100445 to 100435. [2024-10-10 23:32:33,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100435 states, 100434 states have (on average 1.1695640918414083) internal successors, (117464), 100434 states have internal predecessors, (117464), 0 states have call successors, (0), 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-10 23:32:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100435 states to 100435 states and 117464 transitions. [2024-10-10 23:32:33,980 INFO L78 Accepts]: Start accepts. Automaton has 100435 states and 117464 transitions. Word has length 357 [2024-10-10 23:32:33,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:33,981 INFO L471 AbstractCegarLoop]: Abstraction has 100435 states and 117464 transitions. [2024-10-10 23:32:33,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:33,982 INFO L276 IsEmpty]: Start isEmpty. Operand 100435 states and 117464 transitions. [2024-10-10 23:32:33,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2024-10-10 23:32:33,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:33,989 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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-10 23:32:33,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:32:33,990 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:33,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:33,990 INFO L85 PathProgramCache]: Analyzing trace with hash -650491974, now seen corresponding path program 1 times [2024-10-10 23:32:33,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:33,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135222022] [2024-10-10 23:32:33,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:33,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 286 proven. 113 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-10 23:32:35,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:35,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135222022] [2024-10-10 23:32:35,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135222022] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:32:35,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794760917] [2024-10-10 23:32:35,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:35,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:32:35,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:32:35,459 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:32:35,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:32:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:35,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:32:35,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:32:35,782 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-10 23:32:35,782 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:32:35,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794760917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:35,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:32:35,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-10 23:32:35,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964943873] [2024-10-10 23:32:35,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:35,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:35,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:35,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:35,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:32:35,784 INFO L87 Difference]: Start difference. First operand 100435 states and 117464 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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-10 23:32:38,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:38,975 INFO L93 Difference]: Finished difference Result 200081 states and 234135 transitions. [2024-10-10 23:32:38,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:38,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 386 [2024-10-10 23:32:38,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:39,427 INFO L225 Difference]: With dead ends: 200081 [2024-10-10 23:32:39,427 INFO L226 Difference]: Without dead ends: 100434 [2024-10-10 23:32:39,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 385 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-10 23:32:39,520 INFO L432 NwaCegarLoop]: 1362 mSDtfsCounter, 1123 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 2918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:39,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 1443 Invalid, 2918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 2468 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:32:39,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100434 states. [2024-10-10 23:32:40,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100434 to 99645. [2024-10-10 23:32:40,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99645 states, 99644 states have (on average 1.1240315523262816) internal successors, (112003), 99644 states have internal predecessors, (112003), 0 states have call successors, (0), 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-10 23:32:40,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99645 states to 99645 states and 112003 transitions. [2024-10-10 23:32:40,714 INFO L78 Accepts]: Start accepts. Automaton has 99645 states and 112003 transitions. Word has length 386 [2024-10-10 23:32:40,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:40,714 INFO L471 AbstractCegarLoop]: Abstraction has 99645 states and 112003 transitions. [2024-10-10 23:32:40,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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-10 23:32:40,715 INFO L276 IsEmpty]: Start isEmpty. Operand 99645 states and 112003 transitions. [2024-10-10 23:32:40,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2024-10-10 23:32:40,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:40,722 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-10 23:32:40,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:32:40,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-10 23:32:40,923 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:40,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:40,923 INFO L85 PathProgramCache]: Analyzing trace with hash 905211001, now seen corresponding path program 1 times [2024-10-10 23:32:40,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:40,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996681254] [2024-10-10 23:32:40,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:40,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-10-10 23:32:41,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:41,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996681254] [2024-10-10 23:32:41,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996681254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:41,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:41,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:32:41,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463000942] [2024-10-10 23:32:41,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:41,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:41,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:41,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:41,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:32:41,490 INFO L87 Difference]: Start difference. First operand 99645 states and 112003 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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-10 23:32:45,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:45,399 INFO L93 Difference]: Finished difference Result 226844 states and 257626 transitions. [2024-10-10 23:32:45,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:45,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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 416 [2024-10-10 23:32:45,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:45,770 INFO L225 Difference]: With dead ends: 226844 [2024-10-10 23:32:45,771 INFO L226 Difference]: Without dead ends: 127987 [2024-10-10 23:32:45,829 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-10 23:32:45,829 INFO L432 NwaCegarLoop]: 866 mSDtfsCounter, 887 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 932 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 3362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 932 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:45,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 951 Invalid, 3362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [932 Valid, 2430 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-10 23:32:45,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127987 states. [2024-10-10 23:32:47,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127987 to 126393. [2024-10-10 23:32:47,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126393 states, 126392 states have (on average 1.127468510665232) internal successors, (142503), 126392 states have internal predecessors, (142503), 0 states have call successors, (0), 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-10 23:32:47,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126393 states to 126393 states and 142503 transitions. [2024-10-10 23:32:47,468 INFO L78 Accepts]: Start accepts. Automaton has 126393 states and 142503 transitions. Word has length 416 [2024-10-10 23:32:47,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:47,468 INFO L471 AbstractCegarLoop]: Abstraction has 126393 states and 142503 transitions. [2024-10-10 23:32:47,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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-10 23:32:47,469 INFO L276 IsEmpty]: Start isEmpty. Operand 126393 states and 142503 transitions. [2024-10-10 23:32:47,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2024-10-10 23:32:47,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:47,478 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:32:47,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:32:47,479 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:47,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:47,479 INFO L85 PathProgramCache]: Analyzing trace with hash 377208660, now seen corresponding path program 1 times [2024-10-10 23:32:47,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:47,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904479403] [2024-10-10 23:32:47,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:47,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:48,398 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 462 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-10 23:32:48,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:48,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904479403] [2024-10-10 23:32:48,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904479403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:48,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:48,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:32:48,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356303478] [2024-10-10 23:32:48,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:48,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:48,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:48,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:48,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:32:48,400 INFO L87 Difference]: Start difference. First operand 126393 states and 142503 transitions. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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-10 23:32:52,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:52,470 INFO L93 Difference]: Finished difference Result 281132 states and 319663 transitions. [2024-10-10 23:32:52,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:52,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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 454 [2024-10-10 23:32:52,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:52,663 INFO L225 Difference]: With dead ends: 281132 [2024-10-10 23:32:52,664 INFO L226 Difference]: Without dead ends: 155527 [2024-10-10 23:32:52,737 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-10 23:32:52,737 INFO L432 NwaCegarLoop]: 1785 mSDtfsCounter, 779 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2556 mSolverCounterSat, 715 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 3271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 715 IncrementalHoareTripleChecker+Valid, 2556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:52,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1935 Invalid, 3271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [715 Valid, 2556 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-10 23:32:52,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155527 states. [2024-10-10 23:32:54,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155527 to 153936. [2024-10-10 23:32:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153936 states, 153935 states have (on average 1.110923441712411) internal successors, (171010), 153935 states have internal predecessors, (171010), 0 states have call successors, (0), 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-10 23:32:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153936 states to 153936 states and 171010 transitions. [2024-10-10 23:32:54,965 INFO L78 Accepts]: Start accepts. Automaton has 153936 states and 171010 transitions. Word has length 454 [2024-10-10 23:32:54,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:54,966 INFO L471 AbstractCegarLoop]: Abstraction has 153936 states and 171010 transitions. [2024-10-10 23:32:54,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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-10 23:32:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 153936 states and 171010 transitions. [2024-10-10 23:32:54,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2024-10-10 23:32:54,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:54,987 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:32:54,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:32:54,987 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:54,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:54,988 INFO L85 PathProgramCache]: Analyzing trace with hash -79948498, now seen corresponding path program 1 times [2024-10-10 23:32:54,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:54,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660494193] [2024-10-10 23:32:54,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:54,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:55,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1212 backedges. 915 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-10-10 23:32:55,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:55,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660494193] [2024-10-10 23:32:55,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660494193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:55,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:55,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:32:55,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929870282] [2024-10-10 23:32:55,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:55,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:55,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:55,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:55,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:32:55,882 INFO L87 Difference]: Start difference. First operand 153936 states and 171010 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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-10 23:32:59,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:59,634 INFO L93 Difference]: Finished difference Result 307094 states and 341247 transitions. [2024-10-10 23:32:59,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:59,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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 573 [2024-10-10 23:32:59,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:59,822 INFO L225 Difference]: With dead ends: 307094 [2024-10-10 23:32:59,823 INFO L226 Difference]: Without dead ends: 153946 [2024-10-10 23:32:59,876 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-10 23:32:59,877 INFO L432 NwaCegarLoop]: 1414 mSDtfsCounter, 936 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 598 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 3090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 598 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:59,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1505 Invalid, 3090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [598 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:32:59,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153946 states. [2024-10-10 23:33:01,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153946 to 153929. [2024-10-10 23:33:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153929 states, 153928 states have (on average 1.0836949742736863) internal successors, (166811), 153928 states have internal predecessors, (166811), 0 states have call successors, (0), 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-10 23:33:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153929 states to 153929 states and 166811 transitions. [2024-10-10 23:33:02,266 INFO L78 Accepts]: Start accepts. Automaton has 153929 states and 166811 transitions. Word has length 573 [2024-10-10 23:33:02,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:02,266 INFO L471 AbstractCegarLoop]: Abstraction has 153929 states and 166811 transitions. [2024-10-10 23:33:02,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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-10 23:33:02,266 INFO L276 IsEmpty]: Start isEmpty. Operand 153929 states and 166811 transitions. [2024-10-10 23:33:02,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2024-10-10 23:33:02,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:02,296 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:02,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:33:02,297 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:02,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:02,298 INFO L85 PathProgramCache]: Analyzing trace with hash 167209035, now seen corresponding path program 1 times [2024-10-10 23:33:02,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:02,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722444104] [2024-10-10 23:33:02,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:02,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:02,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 809 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2024-10-10 23:33:02,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:02,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722444104] [2024-10-10 23:33:02,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722444104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:02,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:02,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:02,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171755726] [2024-10-10 23:33:02,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:02,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:02,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:02,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:02,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:02,702 INFO L87 Difference]: Start difference. First operand 153929 states and 166811 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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-10 23:33:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:06,946 INFO L93 Difference]: Finished difference Result 314916 states and 340711 transitions. [2024-10-10 23:33:06,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:06,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 609 [2024-10-10 23:33:06,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:07,143 INFO L225 Difference]: With dead ends: 314916 [2024-10-10 23:33:07,143 INFO L226 Difference]: Without dead ends: 158627 [2024-10-10 23:33:07,242 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-10 23:33:07,244 INFO L432 NwaCegarLoop]: 1490 mSDtfsCounter, 1018 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 2938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:07,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 1622 Invalid, 2938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-10 23:33:07,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158627 states. [2024-10-10 23:33:09,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158627 to 148385. [2024-10-10 23:33:09,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148385 states, 148384 states have (on average 1.0593527604054345) internal successors, (157191), 148384 states have internal predecessors, (157191), 0 states have call successors, (0), 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-10 23:33:10,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148385 states to 148385 states and 157191 transitions. [2024-10-10 23:33:10,033 INFO L78 Accepts]: Start accepts. Automaton has 148385 states and 157191 transitions. Word has length 609 [2024-10-10 23:33:10,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:10,033 INFO L471 AbstractCegarLoop]: Abstraction has 148385 states and 157191 transitions. [2024-10-10 23:33:10,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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-10 23:33:10,033 INFO L276 IsEmpty]: Start isEmpty. Operand 148385 states and 157191 transitions. [2024-10-10 23:33:10,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2024-10-10 23:33:10,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:10,058 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:10,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:33:10,059 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:10,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:10,059 INFO L85 PathProgramCache]: Analyzing trace with hash -628912979, now seen corresponding path program 1 times [2024-10-10 23:33:10,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:10,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797629777] [2024-10-10 23:33:10,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:10,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:11,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 705 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2024-10-10 23:33:11,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:11,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797629777] [2024-10-10 23:33:11,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797629777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:11,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:11,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:11,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614477360] [2024-10-10 23:33:11,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:11,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:11,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:11,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:11,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:11,562 INFO L87 Difference]: Start difference. First operand 148385 states and 157191 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)