./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/Problem17_label42.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label42.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 96107ddac20ae25720715e53c2e276b0ff7d668effb9cd422fe5eafc03582006 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:30:06,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:30:06,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:30:06,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:30:06,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:30:06,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:30:06,682 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:30:06,682 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:30:06,683 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:30:06,685 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:30:06,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:30:06,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:30:06,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:30:06,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:30:06,686 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:30:06,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:30:06,686 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:30:06,687 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:30:06,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:30:06,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:30:06,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:30:06,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:30:06,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:30:06,689 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:30:06,690 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:30:06,690 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:30:06,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:30:06,691 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:30:06,691 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:30:06,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:30:06,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:30:06,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:30:06,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:30:06,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:30:06,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:30:06,693 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:30:06,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:30:06,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:30:06,693 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:30:06,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:30:06,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:30:06,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:30:06,694 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 96107ddac20ae25720715e53c2e276b0ff7d668effb9cd422fe5eafc03582006 [2024-10-12 16:30:06,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:30:06,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:30:06,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:30:06,982 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:30:06,983 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:30:06,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label42.c [2024-10-12 16:30:08,421 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:30:08,809 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:30:08,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label42.c [2024-10-12 16:30:08,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a3e7ad8c/cff55740283e48e1a368baca04df52b4/FLAGb8112913d [2024-10-12 16:30:08,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a3e7ad8c/cff55740283e48e1a368baca04df52b4 [2024-10-12 16:30:08,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:30:08,853 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:30:08,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:30:08,855 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:30:08,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:30:08,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:30:08" (1/1) ... [2024-10-12 16:30:08,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6202fdcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:08, skipping insertion in model container [2024-10-12 16:30:08,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:30:08" (1/1) ... [2024-10-12 16:30:08,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:30:09,219 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/Problem17_label42.c[6070,6083] [2024-10-12 16:30:09,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:30:09,760 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:30:09,788 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/Problem17_label42.c[6070,6083] [2024-10-12 16:30:10,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:30:10,174 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:30:10,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:10 WrapperNode [2024-10-12 16:30:10,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:30:10,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:30:10,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:30:10,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:30:10,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:10" (1/1) ... [2024-10-12 16:30:10,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:10" (1/1) ... [2024-10-12 16:30:10,510 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-12 16:30:10,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:30:10,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:30:10,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:30:10,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:30:10,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:10" (1/1) ... [2024-10-12 16:30:10,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:10" (1/1) ... [2024-10-12 16:30:10,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:10" (1/1) ... [2024-10-12 16:30:10,756 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 16:30:10,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:10" (1/1) ... [2024-10-12 16:30:10,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:10" (1/1) ... [2024-10-12 16:30:10,888 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:10" (1/1) ... [2024-10-12 16:30:10,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:10" (1/1) ... [2024-10-12 16:30:10,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:10" (1/1) ... [2024-10-12 16:30:10,972 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:10" (1/1) ... [2024-10-12 16:30:11,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:30:11,075 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:30:11,076 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:30:11,076 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:30:11,077 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:10" (1/1) ... [2024-10-12 16:30:11,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:30:11,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:30:11,107 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 16:30:11,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 16:30:11,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:30:11,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:30:11,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:30:11,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:30:11,223 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:30:11,225 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:30:14,530 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-12 16:30:14,530 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:30:14,600 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:30:14,604 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:30:14,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:30:14 BoogieIcfgContainer [2024-10-12 16:30:14,605 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:30:14,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:30:14,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:30:14,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:30:14,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:30:08" (1/3) ... [2024-10-12 16:30:14,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34029f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:30:14, skipping insertion in model container [2024-10-12 16:30:14,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:10" (2/3) ... [2024-10-12 16:30:14,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34029f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:30:14, skipping insertion in model container [2024-10-12 16:30:14,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:30:14" (3/3) ... [2024-10-12 16:30:14,613 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label42.c [2024-10-12 16:30:14,629 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:30:14,629 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:30:14,712 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:30:14,717 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;@65709fb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:30:14,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:30:14,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-12 16:30:14,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:14,730 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] [2024-10-12 16:30:14,731 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:14,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:14,735 INFO L85 PathProgramCache]: Analyzing trace with hash -762381912, now seen corresponding path program 1 times [2024-10-12 16:30:14,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:14,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476825272] [2024-10-12 16:30:14,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:14,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:14,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:30:14,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:14,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476825272] [2024-10-12 16:30:14,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476825272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:14,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:14,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:30:14,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948464521] [2024-10-12 16:30:14,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:14,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:30:14,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:14,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:30:14,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:30:14,934 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 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 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:15,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:15,031 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-12 16:30:15,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:30:15,037 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-10-12 16:30:15,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:15,055 INFO L225 Difference]: With dead ends: 1055 [2024-10-12 16:30:15,055 INFO L226 Difference]: Without dead ends: 526 [2024-10-12 16:30:15,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:30:15,067 INFO L432 NwaCegarLoop]: 935 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, 935 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:15,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:30:15,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-12 16:30:15,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-12 16:30:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-12 16:30:15,135 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 39 [2024-10-12 16:30:15,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:15,136 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-12 16:30:15,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:15,136 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-12 16:30:15,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-12 16:30:15,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:15,138 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] [2024-10-12 16:30:15,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:30:15,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:15,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:15,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1948411654, now seen corresponding path program 1 times [2024-10-12 16:30:15,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:15,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146549139] [2024-10-12 16:30:15,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:15,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:15,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:30:15,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:15,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146549139] [2024-10-12 16:30:15,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146549139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:15,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:15,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:30:15,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564290347] [2024-10-12 16:30:15,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:15,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:15,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:15,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:15,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:15,348 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:17,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:17,658 INFO L93 Difference]: Finished difference Result 1522 states and 2728 transitions. [2024-10-12 16:30:17,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:17,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-10-12 16:30:17,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:17,666 INFO L225 Difference]: With dead ends: 1522 [2024-10-12 16:30:17,667 INFO L226 Difference]: Without dead ends: 997 [2024-10-12 16:30:17,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:17,669 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 471 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:17,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 239 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 16:30:17,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2024-10-12 16:30:17,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 981. [2024-10-12 16:30:17,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 1.7081632653061225) internal successors, (1674), 980 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:17,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1674 transitions. [2024-10-12 16:30:17,708 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1674 transitions. Word has length 39 [2024-10-12 16:30:17,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:17,709 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1674 transitions. [2024-10-12 16:30:17,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:17,709 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1674 transitions. [2024-10-12 16:30:17,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-12 16:30:17,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:17,717 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:30:17,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:30:17,718 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:17,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:17,720 INFO L85 PathProgramCache]: Analyzing trace with hash -930264441, now seen corresponding path program 1 times [2024-10-12 16:30:17,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:17,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115023169] [2024-10-12 16:30:17,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:17,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:17,909 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:30:17,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:17,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115023169] [2024-10-12 16:30:17,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115023169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:17,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:17,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:30:17,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919481543] [2024-10-12 16:30:17,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:17,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:17,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:17,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:17,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:17,912 INFO L87 Difference]: Start difference. First operand 981 states and 1674 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:20,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:20,031 INFO L93 Difference]: Finished difference Result 2840 states and 4880 transitions. [2024-10-12 16:30:20,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:20,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2024-10-12 16:30:20,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:20,039 INFO L225 Difference]: With dead ends: 2840 [2024-10-12 16:30:20,039 INFO L226 Difference]: Without dead ends: 1860 [2024-10-12 16:30:20,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:20,044 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 407 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:20,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 494 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 16:30:20,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2024-10-12 16:30:20,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1856. [2024-10-12 16:30:20,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1855 states have (on average 1.4549865229110512) internal successors, (2699), 1855 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:20,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2699 transitions. [2024-10-12 16:30:20,091 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 2699 transitions. Word has length 104 [2024-10-12 16:30:20,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:20,091 INFO L471 AbstractCegarLoop]: Abstraction has 1856 states and 2699 transitions. [2024-10-12 16:30:20,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:20,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2699 transitions. [2024-10-12 16:30:20,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-12 16:30:20,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:20,095 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:30:20,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:30:20,096 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:20,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:20,097 INFO L85 PathProgramCache]: Analyzing trace with hash 52578940, now seen corresponding path program 1 times [2024-10-12 16:30:20,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:20,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904611076] [2024-10-12 16:30:20,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:20,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:20,451 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:30:20,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:20,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904611076] [2024-10-12 16:30:20,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904611076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:20,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:20,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:30:20,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235008561] [2024-10-12 16:30:20,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:20,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:20,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:20,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:20,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:20,459 INFO L87 Difference]: Start difference. First operand 1856 states and 2699 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:22,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:22,731 INFO L93 Difference]: Finished difference Result 4590 states and 6639 transitions. [2024-10-12 16:30:22,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:22,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2024-10-12 16:30:22,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:22,741 INFO L225 Difference]: With dead ends: 4590 [2024-10-12 16:30:22,741 INFO L226 Difference]: Without dead ends: 2735 [2024-10-12 16:30:22,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:22,747 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 352 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:22,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 535 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 16:30:22,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2735 states. [2024-10-12 16:30:22,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2735 to 2715. [2024-10-12 16:30:22,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2715 states, 2714 states have (on average 1.3909358879882092) internal successors, (3775), 2714 states have internal predecessors, (3775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 3775 transitions. [2024-10-12 16:30:22,796 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 3775 transitions. Word has length 144 [2024-10-12 16:30:22,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:22,797 INFO L471 AbstractCegarLoop]: Abstraction has 2715 states and 3775 transitions. [2024-10-12 16:30:22,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:22,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 3775 transitions. [2024-10-12 16:30:22,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-12 16:30:22,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:22,800 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:30:22,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:30:22,801 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:22,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:22,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1793263539, now seen corresponding path program 1 times [2024-10-12 16:30:22,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:22,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344281564] [2024-10-12 16:30:22,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:22,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:22,994 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:30:22,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:22,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344281564] [2024-10-12 16:30:22,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344281564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:22,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:22,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:30:22,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694153287] [2024-10-12 16:30:22,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:22,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:22,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:22,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:22,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:22,996 INFO L87 Difference]: Start difference. First operand 2715 states and 3775 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:24,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:24,777 INFO L93 Difference]: Finished difference Result 6708 states and 9428 transitions. [2024-10-12 16:30:24,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:24,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2024-10-12 16:30:24,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:24,791 INFO L225 Difference]: With dead ends: 6708 [2024-10-12 16:30:24,792 INFO L226 Difference]: Without dead ends: 3994 [2024-10-12 16:30:24,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:24,800 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 347 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:24,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 16:30:24,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2024-10-12 16:30:24,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3141. [2024-10-12 16:30:24,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 3140 states have (on average 1.2745222929936306) internal successors, (4002), 3140 states have internal predecessors, (4002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:24,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 4002 transitions. [2024-10-12 16:30:24,854 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 4002 transitions. Word has length 150 [2024-10-12 16:30:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:24,855 INFO L471 AbstractCegarLoop]: Abstraction has 3141 states and 4002 transitions. [2024-10-12 16:30:24,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:24,856 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 4002 transitions. [2024-10-12 16:30:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-12 16:30:24,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:24,859 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, 2, 2, 2, 2, 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] [2024-10-12 16:30:24,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:30:24,860 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:24,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:24,861 INFO L85 PathProgramCache]: Analyzing trace with hash -486675673, now seen corresponding path program 1 times [2024-10-12 16:30:24,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:24,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938315159] [2024-10-12 16:30:24,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:24,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:25,233 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:30:25,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:25,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938315159] [2024-10-12 16:30:25,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938315159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:25,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:25,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 16:30:25,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664721456] [2024-10-12 16:30:25,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:25,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 16:30:25,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:25,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 16:30:25,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 16:30:25,238 INFO L87 Difference]: Start difference. First operand 3141 states and 4002 transitions. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:27,734 INFO L93 Difference]: Finished difference Result 8004 states and 10507 transitions. [2024-10-12 16:30:27,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:30:27,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 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 187 [2024-10-12 16:30:27,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:27,748 INFO L225 Difference]: With dead ends: 8004 [2024-10-12 16:30:27,749 INFO L226 Difference]: Without dead ends: 4864 [2024-10-12 16:30:27,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12 16:30:27,754 INFO L432 NwaCegarLoop]: 763 mSDtfsCounter, 593 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 3094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:27,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 924 Invalid, 3094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [622 Valid, 2472 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 16:30:27,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4864 states. [2024-10-12 16:30:27,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4864 to 4851. [2024-10-12 16:30:27,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4851 states, 4850 states have (on average 1.26659793814433) internal successors, (6143), 4850 states have internal predecessors, (6143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:27,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4851 states to 4851 states and 6143 transitions. [2024-10-12 16:30:27,834 INFO L78 Accepts]: Start accepts. Automaton has 4851 states and 6143 transitions. Word has length 187 [2024-10-12 16:30:27,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:27,837 INFO L471 AbstractCegarLoop]: Abstraction has 4851 states and 6143 transitions. [2024-10-12 16:30:27,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:27,838 INFO L276 IsEmpty]: Start isEmpty. Operand 4851 states and 6143 transitions. [2024-10-12 16:30:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-12 16:30:27,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:27,840 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:30:27,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:30:27,841 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:27,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:27,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1974584216, now seen corresponding path program 1 times [2024-10-12 16:30:27,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:27,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546256202] [2024-10-12 16:30:27,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:27,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:27,986 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-12 16:30:27,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:27,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546256202] [2024-10-12 16:30:27,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546256202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:27,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:27,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:30:27,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495776898] [2024-10-12 16:30:27,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:27,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:27,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:27,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:27,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:27,989 INFO L87 Difference]: Start difference. First operand 4851 states and 6143 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:29,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:29,844 INFO L93 Difference]: Finished difference Result 12248 states and 15824 transitions. [2024-10-12 16:30:29,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:29,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 193 [2024-10-12 16:30:29,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:29,862 INFO L225 Difference]: With dead ends: 12248 [2024-10-12 16:30:29,863 INFO L226 Difference]: Without dead ends: 7398 [2024-10-12 16:30:29,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:29,870 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 407 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:29,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 543 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 16:30:29,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7398 states. [2024-10-12 16:30:29,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7398 to 4825. [2024-10-12 16:30:29,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4825 states, 4824 states have (on average 1.265339966832504) internal successors, (6104), 4824 states have internal predecessors, (6104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:29,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4825 states to 4825 states and 6104 transitions. [2024-10-12 16:30:29,973 INFO L78 Accepts]: Start accepts. Automaton has 4825 states and 6104 transitions. Word has length 193 [2024-10-12 16:30:29,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:29,973 INFO L471 AbstractCegarLoop]: Abstraction has 4825 states and 6104 transitions. [2024-10-12 16:30:29,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:29,974 INFO L276 IsEmpty]: Start isEmpty. Operand 4825 states and 6104 transitions. [2024-10-12 16:30:29,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-12 16:30:29,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:29,976 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:30:29,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:30:29,976 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:29,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:29,977 INFO L85 PathProgramCache]: Analyzing trace with hash 742306396, now seen corresponding path program 1 times [2024-10-12 16:30:29,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:29,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228402998] [2024-10-12 16:30:29,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:29,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:30,188 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:30:30,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:30,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228402998] [2024-10-12 16:30:30,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228402998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:30,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:30,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:30:30,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730695567] [2024-10-12 16:30:30,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:30,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:30,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:30,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:30,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:30,192 INFO L87 Difference]: Start difference. First operand 4825 states and 6104 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:31,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:31,967 INFO L93 Difference]: Finished difference Result 13929 states and 17665 transitions. [2024-10-12 16:30:31,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:31,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2024-10-12 16:30:31,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:31,989 INFO L225 Difference]: With dead ends: 13929 [2024-10-12 16:30:31,989 INFO L226 Difference]: Without dead ends: 7827 [2024-10-12 16:30:31,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:31,994 INFO L432 NwaCegarLoop]: 876 mSDtfsCounter, 418 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 1704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:31,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 950 Invalid, 1704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 16:30:32,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7827 states. [2024-10-12 16:30:32,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7827 to 7821. [2024-10-12 16:30:32,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7821 states, 7820 states have (on average 1.1792838874680307) internal successors, (9222), 7820 states have internal predecessors, (9222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:32,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7821 states to 7821 states and 9222 transitions. [2024-10-12 16:30:32,150 INFO L78 Accepts]: Start accepts. Automaton has 7821 states and 9222 transitions. Word has length 206 [2024-10-12 16:30:32,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:32,150 INFO L471 AbstractCegarLoop]: Abstraction has 7821 states and 9222 transitions. [2024-10-12 16:30:32,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:32,151 INFO L276 IsEmpty]: Start isEmpty. Operand 7821 states and 9222 transitions. [2024-10-12 16:30:32,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-10-12 16:30:32,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:32,156 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:30:32,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:30:32,156 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:32,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:32,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2043621470, now seen corresponding path program 1 times [2024-10-12 16:30:32,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:32,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659358334] [2024-10-12 16:30:32,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:32,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:32,616 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 75 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:30:32,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:32,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659358334] [2024-10-12 16:30:32,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659358334] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:30:32,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773335642] [2024-10-12 16:30:32,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:32,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:30:32,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:30:32,620 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:30:32,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 16:30:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:32,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 16:30:32,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:30:33,094 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 75 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:30:33,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 16:30:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:30:33,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773335642] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 16:30:33,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 16:30:33,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 7 [2024-10-12 16:30:33,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961470820] [2024-10-12 16:30:33,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:33,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:30:33,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:33,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:30:33,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 16:30:33,466 INFO L87 Difference]: Start difference. First operand 7821 states and 9222 transitions. Second operand has 4 states, 4 states have (on average 64.75) 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-12 16:30:36,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:36,269 INFO L93 Difference]: Finished difference Result 26747 states and 31820 transitions. [2024-10-12 16:30:36,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:30:36,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.75) 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-12 16:30:36,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:36,306 INFO L225 Difference]: With dead ends: 26747 [2024-10-12 16:30:36,307 INFO L226 Difference]: Without dead ends: 18496 [2024-10-12 16:30:36,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 16:30:36,319 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 1007 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 2219 mSolverCounterSat, 1151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 3370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1151 IncrementalHoareTripleChecker+Valid, 2219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:36,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 144 Invalid, 3370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1151 Valid, 2219 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 16:30:36,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18496 states. [2024-10-12 16:30:36,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18496 to 18494. [2024-10-12 16:30:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18494 states, 18493 states have (on average 1.1611961282647487) internal successors, (21474), 18493 states have internal predecessors, (21474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18494 states to 18494 states and 21474 transitions. [2024-10-12 16:30:36,577 INFO L78 Accepts]: Start accepts. Automaton has 18494 states and 21474 transitions. Word has length 259 [2024-10-12 16:30:36,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:36,578 INFO L471 AbstractCegarLoop]: Abstraction has 18494 states and 21474 transitions. [2024-10-12 16:30:36,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.75) 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-12 16:30:36,579 INFO L276 IsEmpty]: Start isEmpty. Operand 18494 states and 21474 transitions. [2024-10-12 16:30:36,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-10-12 16:30:36,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:36,583 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:30:36,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 16:30:36,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:30:36,785 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:36,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:36,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1471218520, now seen corresponding path program 1 times [2024-10-12 16:30:36,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:36,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423918684] [2024-10-12 16:30:36,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:36,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-12 16:30:37,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:37,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423918684] [2024-10-12 16:30:37,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423918684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:37,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:37,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:30:37,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393282455] [2024-10-12 16:30:37,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:37,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:37,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:37,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:37,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:37,037 INFO L87 Difference]: Start difference. First operand 18494 states and 21474 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:38,622 INFO L93 Difference]: Finished difference Result 40389 states and 46979 transitions. [2024-10-12 16:30:38,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:38,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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 276 [2024-10-12 16:30:38,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:38,660 INFO L225 Difference]: With dead ends: 40389 [2024-10-12 16:30:38,660 INFO L226 Difference]: Without dead ends: 21470 [2024-10-12 16:30:38,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:38,683 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 384 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:38,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 841 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:30:38,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21470 states. [2024-10-12 16:30:38,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21470 to 21470. [2024-10-12 16:30:38,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21470 states, 21469 states have (on average 1.1432297731613024) internal successors, (24544), 21469 states have internal predecessors, (24544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:39,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21470 states to 21470 states and 24544 transitions. [2024-10-12 16:30:39,112 INFO L78 Accepts]: Start accepts. Automaton has 21470 states and 24544 transitions. Word has length 276 [2024-10-12 16:30:39,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:39,116 INFO L471 AbstractCegarLoop]: Abstraction has 21470 states and 24544 transitions. [2024-10-12 16:30:39,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:39,117 INFO L276 IsEmpty]: Start isEmpty. Operand 21470 states and 24544 transitions. [2024-10-12 16:30:39,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2024-10-12 16:30:39,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:39,126 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:30:39,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 16:30:39,127 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:39,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:39,128 INFO L85 PathProgramCache]: Analyzing trace with hash 352785438, now seen corresponding path program 1 times [2024-10-12 16:30:39,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:39,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936877696] [2024-10-12 16:30:39,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:39,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-10-12 16:30:39,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:39,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936877696] [2024-10-12 16:30:39,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936877696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:39,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:39,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:30:39,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498526411] [2024-10-12 16:30:39,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:39,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:39,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:39,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:39,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:39,564 INFO L87 Difference]: Start difference. First operand 21470 states and 24544 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:41,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:41,224 INFO L93 Difference]: Finished difference Result 52348 states and 59967 transitions. [2024-10-12 16:30:41,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:41,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 311 [2024-10-12 16:30:41,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:41,267 INFO L225 Difference]: With dead ends: 52348 [2024-10-12 16:30:41,267 INFO L226 Difference]: Without dead ends: 30451 [2024-10-12 16:30:41,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:41,288 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 459 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:41,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 325 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:30:41,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30451 states. [2024-10-12 16:30:41,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30451 to 21467. [2024-10-12 16:30:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21467 states, 21466 states have (on average 1.142085157924159) internal successors, (24516), 21466 states have internal predecessors, (24516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:41,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21467 states to 21467 states and 24516 transitions. [2024-10-12 16:30:41,529 INFO L78 Accepts]: Start accepts. Automaton has 21467 states and 24516 transitions. Word has length 311 [2024-10-12 16:30:41,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:41,529 INFO L471 AbstractCegarLoop]: Abstraction has 21467 states and 24516 transitions. [2024-10-12 16:30:41,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:41,530 INFO L276 IsEmpty]: Start isEmpty. Operand 21467 states and 24516 transitions. [2024-10-12 16:30:41,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-10-12 16:30:41,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:41,537 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:30:41,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 16:30:41,537 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:41,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:41,538 INFO L85 PathProgramCache]: Analyzing trace with hash -2021237956, now seen corresponding path program 1 times [2024-10-12 16:30:41,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:41,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987870197] [2024-10-12 16:30:41,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:41,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-12 16:30:41,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:41,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987870197] [2024-10-12 16:30:41,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987870197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:41,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:41,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:30:41,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417387443] [2024-10-12 16:30:41,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:41,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:41,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:41,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:41,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:41,950 INFO L87 Difference]: Start difference. First operand 21467 states and 24516 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:43,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:43,547 INFO L93 Difference]: Finished difference Result 51041 states and 58360 transitions. [2024-10-12 16:30:43,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:43,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 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 333 [2024-10-12 16:30:43,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:43,580 INFO L225 Difference]: With dead ends: 51041 [2024-10-12 16:30:43,580 INFO L226 Difference]: Without dead ends: 29575 [2024-10-12 16:30:43,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:43,601 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 326 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:43,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 840 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:30:43,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29575 states. [2024-10-12 16:30:43,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29575 to 27852. [2024-10-12 16:30:43,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27852 states, 27851 states have (on average 1.1288284083156799) internal successors, (31439), 27851 states have internal predecessors, (31439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:43,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27852 states to 27852 states and 31439 transitions. [2024-10-12 16:30:43,899 INFO L78 Accepts]: Start accepts. Automaton has 27852 states and 31439 transitions. Word has length 333 [2024-10-12 16:30:43,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:43,900 INFO L471 AbstractCegarLoop]: Abstraction has 27852 states and 31439 transitions. [2024-10-12 16:30:43,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 27852 states and 31439 transitions. [2024-10-12 16:30:43,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-10-12 16:30:43,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:43,907 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:30:43,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 16:30:43,908 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:43,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:43,908 INFO L85 PathProgramCache]: Analyzing trace with hash 636064546, now seen corresponding path program 1 times [2024-10-12 16:30:43,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:43,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916749368] [2024-10-12 16:30:43,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:43,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 355 proven. 73 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-10-12 16:30:44,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:44,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916749368] [2024-10-12 16:30:44,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916749368] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:30:44,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097247120] [2024-10-12 16:30:44,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:44,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:30:44,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:30:44,360 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:30:44,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 16:30:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:44,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 16:30:44,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:30:44,678 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 355 proven. 73 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-10-12 16:30:44,678 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 16:30:44,938 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-10-12 16:30:44,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097247120] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 16:30:44,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 16:30:44,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-10-12 16:30:44,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985216216] [2024-10-12 16:30:44,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:44,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:30:44,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:44,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:30:44,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:30:44,941 INFO L87 Difference]: Start difference. First operand 27852 states and 31439 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:47,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:47,576 INFO L93 Difference]: Finished difference Result 68930 states and 77944 transitions. [2024-10-12 16:30:47,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:30:47,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 337 [2024-10-12 16:30:47,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:47,627 INFO L225 Difference]: With dead ends: 68930 [2024-10-12 16:30:47,627 INFO L226 Difference]: Without dead ends: 40652 [2024-10-12 16:30:47,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 671 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:30:47,657 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 856 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 2340 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 2848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 2340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:47,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 204 Invalid, 2848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [508 Valid, 2340 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 16:30:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40652 states. [2024-10-12 16:30:47,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40652 to 38523. [2024-10-12 16:30:48,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38523 states, 38522 states have (on average 1.1351435543325892) internal successors, (43728), 38522 states have internal predecessors, (43728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38523 states to 38523 states and 43728 transitions. [2024-10-12 16:30:48,077 INFO L78 Accepts]: Start accepts. Automaton has 38523 states and 43728 transitions. Word has length 337 [2024-10-12 16:30:48,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:48,078 INFO L471 AbstractCegarLoop]: Abstraction has 38523 states and 43728 transitions. [2024-10-12 16:30:48,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:48,078 INFO L276 IsEmpty]: Start isEmpty. Operand 38523 states and 43728 transitions. [2024-10-12 16:30:48,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-12 16:30:48,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:48,084 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:30:48,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 16:30:48,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-12 16:30:48,285 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:48,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:48,286 INFO L85 PathProgramCache]: Analyzing trace with hash 302108357, now seen corresponding path program 1 times [2024-10-12 16:30:48,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:48,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358366601] [2024-10-12 16:30:48,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:48,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:48,629 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-12 16:30:48,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:48,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358366601] [2024-10-12 16:30:48,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358366601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:48,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:48,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:30:48,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660373778] [2024-10-12 16:30:48,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:48,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:48,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:48,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:48,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:48,633 INFO L87 Difference]: Start difference. First operand 38523 states and 43728 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) 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-12 16:30:50,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:50,230 INFO L93 Difference]: Finished difference Result 82166 states and 93322 transitions. [2024-10-12 16:30:50,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:50,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) 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 351 [2024-10-12 16:30:50,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:50,271 INFO L225 Difference]: With dead ends: 82166 [2024-10-12 16:30:50,272 INFO L226 Difference]: Without dead ends: 43213 [2024-10-12 16:30:50,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:50,299 INFO L432 NwaCegarLoop]: 764 mSDtfsCounter, 436 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:50,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 832 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:30:50,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43213 states. [2024-10-12 16:30:50,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43213 to 41081. [2024-10-12 16:30:50,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41081 states, 41080 states have (on average 1.1328140214216165) internal successors, (46536), 41080 states have internal predecessors, (46536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41081 states to 41081 states and 46536 transitions. [2024-10-12 16:30:50,783 INFO L78 Accepts]: Start accepts. Automaton has 41081 states and 46536 transitions. Word has length 351 [2024-10-12 16:30:50,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:50,784 INFO L471 AbstractCegarLoop]: Abstraction has 41081 states and 46536 transitions. [2024-10-12 16:30:50,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) 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-12 16:30:50,784 INFO L276 IsEmpty]: Start isEmpty. Operand 41081 states and 46536 transitions. [2024-10-12 16:30:50,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-10-12 16:30:50,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:50,789 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:30:50,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 16:30:50,790 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:50,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:50,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1664220890, now seen corresponding path program 1 times [2024-10-12 16:30:50,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:50,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016307671] [2024-10-12 16:30:50,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:50,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-12 16:30:51,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:51,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016307671] [2024-10-12 16:30:51,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016307671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:51,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:51,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:30:51,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819295448] [2024-10-12 16:30:51,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:51,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:51,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:51,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:51,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:51,056 INFO L87 Difference]: Start difference. First operand 41081 states and 46536 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:52,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:52,629 INFO L93 Difference]: Finished difference Result 86417 states and 98039 transitions. [2024-10-12 16:30:52,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:52,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 382 [2024-10-12 16:30:52,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:52,681 INFO L225 Difference]: With dead ends: 86417 [2024-10-12 16:30:52,681 INFO L226 Difference]: Without dead ends: 44912 [2024-10-12 16:30:52,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:52,704 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 401 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:52,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 877 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:30:52,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44912 states. [2024-10-12 16:30:53,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44912 to 44910. [2024-10-12 16:30:53,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44910 states, 44909 states have (on average 1.1258545057783518) internal successors, (50561), 44909 states have internal predecessors, (50561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:53,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44910 states to 44910 states and 50561 transitions. [2024-10-12 16:30:53,280 INFO L78 Accepts]: Start accepts. Automaton has 44910 states and 50561 transitions. Word has length 382 [2024-10-12 16:30:53,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:53,281 INFO L471 AbstractCegarLoop]: Abstraction has 44910 states and 50561 transitions. [2024-10-12 16:30:53,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:53,281 INFO L276 IsEmpty]: Start isEmpty. Operand 44910 states and 50561 transitions. [2024-10-12 16:30:53,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2024-10-12 16:30:53,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:53,291 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:30:53,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 16:30:53,292 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:53,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:53,292 INFO L85 PathProgramCache]: Analyzing trace with hash 844440723, now seen corresponding path program 1 times [2024-10-12 16:30:53,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:53,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657992239] [2024-10-12 16:30:53,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:53,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:53,935 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-12 16:30:53,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:53,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657992239] [2024-10-12 16:30:53,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657992239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:53,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:53,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:30:53,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556713496] [2024-10-12 16:30:53,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:53,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:53,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:53,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:53,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:53,938 INFO L87 Difference]: Start difference. First operand 44910 states and 50561 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:55,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:55,614 INFO L93 Difference]: Finished difference Result 100496 states and 112915 transitions. [2024-10-12 16:30:55,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:55,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 421 [2024-10-12 16:30:55,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:55,674 INFO L225 Difference]: With dead ends: 100496 [2024-10-12 16:30:55,674 INFO L226 Difference]: Without dead ends: 55158 [2024-10-12 16:30:55,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:55,705 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 487 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:55,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 192 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:30:55,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55158 states. [2024-10-12 16:30:56,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55158 to 53852. [2024-10-12 16:30:56,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53852 states, 53851 states have (on average 1.1217433288146923) internal successors, (60407), 53851 states have internal predecessors, (60407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53852 states to 53852 states and 60407 transitions. [2024-10-12 16:30:56,466 INFO L78 Accepts]: Start accepts. Automaton has 53852 states and 60407 transitions. Word has length 421 [2024-10-12 16:30:56,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:56,467 INFO L471 AbstractCegarLoop]: Abstraction has 53852 states and 60407 transitions. [2024-10-12 16:30:56,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:56,467 INFO L276 IsEmpty]: Start isEmpty. Operand 53852 states and 60407 transitions. [2024-10-12 16:30:56,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2024-10-12 16:30:56,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:56,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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:30:56,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 16:30:56,479 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:56,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:56,480 INFO L85 PathProgramCache]: Analyzing trace with hash -157988801, now seen corresponding path program 1 times [2024-10-12 16:30:56,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:56,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369538547] [2024-10-12 16:30:56,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:56,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:56,984 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 539 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-10-12 16:30:56,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:56,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369538547] [2024-10-12 16:30:56,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369538547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:56,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:56,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:30:56,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871484790] [2024-10-12 16:30:56,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:56,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:56,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:56,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:56,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:56,988 INFO L87 Difference]: Start difference. First operand 53852 states and 60407 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:58,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:58,735 INFO L93 Difference]: Finished difference Result 125157 states and 140433 transitions. [2024-10-12 16:30:58,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:58,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2024-10-12 16:30:58,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:58,806 INFO L225 Difference]: With dead ends: 125157 [2024-10-12 16:30:58,806 INFO L226 Difference]: Without dead ends: 67463 [2024-10-12 16:30:58,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:58,832 INFO L432 NwaCegarLoop]: 613 mSDtfsCounter, 446 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:58,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 654 Invalid, 1492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:30:58,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67463 states. [2024-10-12 16:30:59,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67463 to 62341. [2024-10-12 16:30:59,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62341 states, 62340 states have (on average 1.1151106833493745) internal successors, (69516), 62340 states have internal predecessors, (69516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62341 states to 62341 states and 69516 transitions. [2024-10-12 16:30:59,789 INFO L78 Accepts]: Start accepts. Automaton has 62341 states and 69516 transitions. Word has length 439 [2024-10-12 16:30:59,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:59,790 INFO L471 AbstractCegarLoop]: Abstraction has 62341 states and 69516 transitions. [2024-10-12 16:30:59,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:59,790 INFO L276 IsEmpty]: Start isEmpty. Operand 62341 states and 69516 transitions. [2024-10-12 16:30:59,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2024-10-12 16:30:59,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:59,796 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:30:59,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 16:30:59,796 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:59,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:59,797 INFO L85 PathProgramCache]: Analyzing trace with hash -166097674, now seen corresponding path program 1 times [2024-10-12 16:30:59,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:59,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922103788] [2024-10-12 16:30:59,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:59,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:31:00,286 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2024-10-12 16:31:00,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:31:00,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922103788] [2024-10-12 16:31:00,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922103788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:31:00,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:31:00,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:31:00,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116490715] [2024-10-12 16:31:00,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:31:00,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:31:00,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:31:00,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:31:00,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:31:00,289 INFO L87 Difference]: Start difference. First operand 62341 states and 69516 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:31:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:31:01,898 INFO L93 Difference]: Finished difference Result 130193 states and 145274 transitions. [2024-10-12 16:31:01,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:31:01,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 443 [2024-10-12 16:31:01,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:31:01,968 INFO L225 Difference]: With dead ends: 130193 [2024-10-12 16:31:01,969 INFO L226 Difference]: Without dead ends: 67422 [2024-10-12 16:31:02,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:31:02,005 INFO L432 NwaCegarLoop]: 660 mSDtfsCounter, 440 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:31:02,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 708 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 16:31:02,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67422 states. [2024-10-12 16:31:02,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67422 to 60614. [2024-10-12 16:31:02,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60614 states, 60613 states have (on average 1.1074686948344414) internal successors, (67127), 60613 states have internal predecessors, (67127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:31:03,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60614 states to 60614 states and 67127 transitions. [2024-10-12 16:31:03,063 INFO L78 Accepts]: Start accepts. Automaton has 60614 states and 67127 transitions. Word has length 443 [2024-10-12 16:31:03,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:31:03,064 INFO L471 AbstractCegarLoop]: Abstraction has 60614 states and 67127 transitions. [2024-10-12 16:31:03,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:31:03,064 INFO L276 IsEmpty]: Start isEmpty. Operand 60614 states and 67127 transitions. [2024-10-12 16:31:03,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2024-10-12 16:31:03,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:31:03,077 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:31:03,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 16:31:03,077 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:31:03,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:31:03,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1022718223, now seen corresponding path program 1 times [2024-10-12 16:31:03,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:31:03,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594085827] [2024-10-12 16:31:03,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:31:03,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:31:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:31:03,417 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-12 16:31:03,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:31:03,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594085827] [2024-10-12 16:31:03,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594085827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:31:03,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:31:03,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:31:03,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550150423] [2024-10-12 16:31:03,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:31:03,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:31:03,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:31:03,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:31:03,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:31:03,421 INFO L87 Difference]: Start difference. First operand 60614 states and 67127 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:31:05,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:31:05,080 INFO L93 Difference]: Finished difference Result 131453 states and 145576 transitions. [2024-10-12 16:31:05,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:31:05,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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 474 [2024-10-12 16:31:05,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:31:05,150 INFO L225 Difference]: With dead ends: 131453 [2024-10-12 16:31:05,150 INFO L226 Difference]: Without dead ends: 70408 [2024-10-12 16:31:05,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:31:05,189 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 474 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:31:05,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 118 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:31:05,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70408 states. [2024-10-12 16:31:06,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70408 to 58885. [2024-10-12 16:31:06,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58885 states, 58884 states have (on average 1.1044426329733035) internal successors, (65034), 58884 states have internal predecessors, (65034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:31:06,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58885 states to 58885 states and 65034 transitions. [2024-10-12 16:31:06,126 INFO L78 Accepts]: Start accepts. Automaton has 58885 states and 65034 transitions. Word has length 474 [2024-10-12 16:31:06,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:31:06,127 INFO L471 AbstractCegarLoop]: Abstraction has 58885 states and 65034 transitions. [2024-10-12 16:31:06,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:31:06,127 INFO L276 IsEmpty]: Start isEmpty. Operand 58885 states and 65034 transitions. [2024-10-12 16:31:06,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2024-10-12 16:31:06,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:31:06,137 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:31:06,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 16:31:06,138 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:31:06,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:31:06,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1098272777, now seen corresponding path program 1 times [2024-10-12 16:31:06,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:31:06,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243218506] [2024-10-12 16:31:06,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:31:06,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:31:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:31:06,676 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-10-12 16:31:06,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:31:06,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243218506] [2024-10-12 16:31:06,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243218506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:31:06,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:31:06,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:31:06,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383948201] [2024-10-12 16:31:06,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:31:06,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:31:06,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:31:06,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:31:06,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:31:06,679 INFO L87 Difference]: Start difference. First operand 58885 states and 65034 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:31:08,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:31:08,279 INFO L93 Difference]: Finished difference Result 127984 states and 141201 transitions. [2024-10-12 16:31:08,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:31:08,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 482 [2024-10-12 16:31:08,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:31:08,356 INFO L225 Difference]: With dead ends: 127984 [2024-10-12 16:31:08,356 INFO L226 Difference]: Without dead ends: 68675 [2024-10-12 16:31:08,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:31:08,397 INFO L432 NwaCegarLoop]: 698 mSDtfsCounter, 267 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:31:08,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 741 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 16:31:08,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68675 states. [2024-10-12 16:31:09,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68675 to 57574. [2024-10-12 16:31:09,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57574 states, 57573 states have (on average 1.1018185607837008) internal successors, (63435), 57573 states have internal predecessors, (63435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:31:09,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57574 states to 57574 states and 63435 transitions. [2024-10-12 16:31:09,175 INFO L78 Accepts]: Start accepts. Automaton has 57574 states and 63435 transitions. Word has length 482 [2024-10-12 16:31:09,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:31:09,175 INFO L471 AbstractCegarLoop]: Abstraction has 57574 states and 63435 transitions. [2024-10-12 16:31:09,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:31:09,175 INFO L276 IsEmpty]: Start isEmpty. Operand 57574 states and 63435 transitions. [2024-10-12 16:31:09,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2024-10-12 16:31:09,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:31:09,187 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:31:09,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 16:31:09,187 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:31:09,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:31:09,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1499458442, now seen corresponding path program 1 times [2024-10-12 16:31:09,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:31:09,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864985388] [2024-10-12 16:31:09,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:31:09,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:31:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:31:09,629 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2024-10-12 16:31:09,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:31:09,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864985388] [2024-10-12 16:31:09,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864985388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:31:09,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:31:09,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:31:09,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832035002] [2024-10-12 16:31:09,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:31:09,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:31:09,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:31:09,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:31:09,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:31:09,632 INFO L87 Difference]: Start difference. First operand 57574 states and 63435 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:31:11,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:31:11,041 INFO L93 Difference]: Finished difference Result 123653 states and 136225 transitions. [2024-10-12 16:31:11,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:31:11,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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 559 [2024-10-12 16:31:11,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:31:11,109 INFO L225 Difference]: With dead ends: 123653 [2024-10-12 16:31:11,109 INFO L226 Difference]: Without dead ends: 65655 [2024-10-12 16:31:11,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:31:11,145 INFO L432 NwaCegarLoop]: 639 mSDtfsCounter, 475 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:31:11,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 678 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:31:11,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65655 states. [2024-10-12 16:31:12,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65655 to 65649. [2024-10-12 16:31:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65649 states, 65648 states have (on average 1.0945192542042408) internal successors, (71853), 65648 states have internal predecessors, (71853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:31:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65649 states to 65649 states and 71853 transitions. [2024-10-12 16:31:12,198 INFO L78 Accepts]: Start accepts. Automaton has 65649 states and 71853 transitions. Word has length 559 [2024-10-12 16:31:12,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:31:12,199 INFO L471 AbstractCegarLoop]: Abstraction has 65649 states and 71853 transitions. [2024-10-12 16:31:12,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:31:12,199 INFO L276 IsEmpty]: Start isEmpty. Operand 65649 states and 71853 transitions. [2024-10-12 16:31:12,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2024-10-12 16:31:12,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:31:12,231 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:31:12,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 16:31:12,232 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:31:12,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:31:12,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1561404277, now seen corresponding path program 1 times [2024-10-12 16:31:12,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:31:12,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897412859] [2024-10-12 16:31:12,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:31:12,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:31:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:31:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 721 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2024-10-12 16:31:12,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:31:12,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897412859] [2024-10-12 16:31:12,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897412859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:31:12,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:31:12,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:31:12,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976004498] [2024-10-12 16:31:12,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:31:12,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:31:12,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:31:12,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:31:12,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:31:12,839 INFO L87 Difference]: Start difference. First operand 65649 states and 71853 transitions. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:31:14,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:31:14,285 INFO L93 Difference]: Finished difference Result 139374 states and 152645 transitions. [2024-10-12 16:31:14,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:31:14,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 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 696 [2024-10-12 16:31:14,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:31:14,625 INFO L225 Difference]: With dead ends: 139374 [2024-10-12 16:31:14,625 INFO L226 Difference]: Without dead ends: 73301 [2024-10-12 16:31:14,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:31:14,651 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 438 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:31:14,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 328 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:31:14,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73301 states. [2024-10-12 16:31:15,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73301 to 68194. [2024-10-12 16:31:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68194 states, 68193 states have (on average 1.0906251374774536) internal successors, (74373), 68193 states have internal predecessors, (74373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:31:15,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68194 states to 68194 states and 74373 transitions. [2024-10-12 16:31:15,462 INFO L78 Accepts]: Start accepts. Automaton has 68194 states and 74373 transitions. Word has length 696 [2024-10-12 16:31:15,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:31:15,462 INFO L471 AbstractCegarLoop]: Abstraction has 68194 states and 74373 transitions. [2024-10-12 16:31:15,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:31:15,463 INFO L276 IsEmpty]: Start isEmpty. Operand 68194 states and 74373 transitions. [2024-10-12 16:31:15,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 805 [2024-10-12 16:31:15,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:31:15,512 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:31:15,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 16:31:15,513 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:31:15,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:31:15,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2069566523, now seen corresponding path program 1 times [2024-10-12 16:31:15,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:31:15,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310606364] [2024-10-12 16:31:15,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:31:15,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:31:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:31:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2024-10-12 16:31:15,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:31:15,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310606364] [2024-10-12 16:31:15,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310606364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:31:15,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:31:15,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:31:15,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551870684] [2024-10-12 16:31:15,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:31:15,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:31:15,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:31:15,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:31:15,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:31:15,899 INFO L87 Difference]: Start difference. First operand 68194 states and 74373 transitions. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:31:17,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:31:17,601 INFO L93 Difference]: Finished difference Result 140639 states and 153540 transitions. [2024-10-12 16:31:17,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:31:17,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 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 804 [2024-10-12 16:31:17,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:31:17,685 INFO L225 Difference]: With dead ends: 140639 [2024-10-12 16:31:17,685 INFO L226 Difference]: Without dead ends: 72446 [2024-10-12 16:31:17,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:31:17,728 INFO L432 NwaCegarLoop]: 668 mSDtfsCounter, 453 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:31:17,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 711 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 16:31:17,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72446 states. [2024-10-12 16:31:18,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72446 to 65636. [2024-10-12 16:31:18,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65636 states, 65635 states have (on average 1.0788755999085853) internal successors, (70812), 65635 states have internal predecessors, (70812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:31:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65636 states to 65636 states and 70812 transitions. [2024-10-12 16:31:18,809 INFO L78 Accepts]: Start accepts. Automaton has 65636 states and 70812 transitions. Word has length 804 [2024-10-12 16:31:18,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:31:18,809 INFO L471 AbstractCegarLoop]: Abstraction has 65636 states and 70812 transitions. [2024-10-12 16:31:18,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:31:18,810 INFO L276 IsEmpty]: Start isEmpty. Operand 65636 states and 70812 transitions. [2024-10-12 16:31:18,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2024-10-12 16:31:18,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:31:18,849 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:31:18,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 16:31:18,849 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:31:18,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:31:18,850 INFO L85 PathProgramCache]: Analyzing trace with hash 534866233, now seen corresponding path program 1 times [2024-10-12 16:31:18,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:31:18,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830408150] [2024-10-12 16:31:18,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:31:18,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:31:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:31:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 747 trivial. 0 not checked. [2024-10-12 16:31:19,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:31:19,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830408150] [2024-10-12 16:31:19,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830408150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:31:19,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:31:19,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:31:19,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084367782] [2024-10-12 16:31:19,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:31:19,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:31:19,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:31:19,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:31:19,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:31:19,296 INFO L87 Difference]: Start difference. First operand 65636 states and 70812 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 2 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:31:20,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:31:20,349 INFO L93 Difference]: Finished difference Result 126144 states and 136026 transitions. [2024-10-12 16:31:20,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:31:20,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 2 states have internal predecessors, (362), 0 states have call successors, (0), 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 837 [2024-10-12 16:31:20,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:31:20,406 INFO L225 Difference]: With dead ends: 126144 [2024-10-12 16:31:20,406 INFO L226 Difference]: Without dead ends: 60509 [2024-10-12 16:31:20,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:31:20,443 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 358 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:31:20,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 68 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 16:31:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60509 states. [2024-10-12 16:31:21,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60509 to 60507. [2024-10-12 16:31:21,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60507 states, 60506 states have (on average 1.0776121376392425) internal successors, (65202), 60506 states have internal predecessors, (65202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:31:21,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60507 states to 60507 states and 65202 transitions. [2024-10-12 16:31:21,238 INFO L78 Accepts]: Start accepts. Automaton has 60507 states and 65202 transitions. Word has length 837 [2024-10-12 16:31:21,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:31:21,239 INFO L471 AbstractCegarLoop]: Abstraction has 60507 states and 65202 transitions. [2024-10-12 16:31:21,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 2 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:31:21,239 INFO L276 IsEmpty]: Start isEmpty. Operand 60507 states and 65202 transitions. [2024-10-12 16:31:21,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1433 [2024-10-12 16:31:21,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:31:21,289 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12 16:31:21,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 16:31:21,289 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:31:21,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:31:21,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1033911342, now seen corresponding path program 1 times [2024-10-12 16:31:21,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:31:21,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926963499] [2024-10-12 16:31:21,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:31:21,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:31:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:31:22,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2526 backedges. 1840 proven. 0 refuted. 0 times theorem prover too weak. 686 trivial. 0 not checked. [2024-10-12 16:31:22,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:31:22,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926963499] [2024-10-12 16:31:22,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926963499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:31:22,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:31:22,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:31:22,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287908590] [2024-10-12 16:31:22,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:31:22,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:31:22,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:31:22,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:31:22,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:31:22,352 INFO L87 Difference]: Start difference. First operand 60507 states and 65202 transitions. Second operand has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)