./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/Problem12_label54.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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/Problem12_label54.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 9f137b4cfcf2c394c1a64ac698bc08e2e305ac6959ca2787cbc9ca23749e2553 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 21:09:33,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 21:09:33,729 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 21:09:33,735 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 21:09:33,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 21:09:33,767 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 21:09:33,768 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 21:09:33,768 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 21:09:33,769 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 21:09:33,769 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 21:09:33,769 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 21:09:33,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 21:09:33,770 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 21:09:33,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 21:09:33,771 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 21:09:33,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 21:09:33,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 21:09:33,772 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 21:09:33,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 21:09:33,773 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 21:09:33,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 21:09:33,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 21:09:33,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 21:09:33,778 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 21:09:33,778 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 21:09:33,778 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 21:09:33,779 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 21:09:33,779 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 21:09:33,779 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 21:09:33,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 21:09:33,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 21:09:33,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 21:09:33,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:09:33,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 21:09:33,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 21:09:33,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 21:09:33,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 21:09:33,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 21:09:33,785 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 21:09:33,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 21:09:33,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 21:09:33,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 21:09:33,787 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 -> 9f137b4cfcf2c394c1a64ac698bc08e2e305ac6959ca2787cbc9ca23749e2553 [2024-10-23 21:09:34,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 21:09:34,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 21:09:34,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 21:09:34,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 21:09:34,091 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 21:09:34,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label54.c [2024-10-23 21:09:35,539 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 21:09:35,986 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 21:09:35,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label54.c [2024-10-23 21:09:36,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/222db6114/0534c4b51aeb46b4be0438be5566751e/FLAG4dc11c5e7 [2024-10-23 21:09:36,110 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/222db6114/0534c4b51aeb46b4be0438be5566751e [2024-10-23 21:09:36,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 21:09:36,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 21:09:36,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 21:09:36,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 21:09:36,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 21:09:36,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:09:36" (1/1) ... [2024-10-23 21:09:36,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60e77d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:09:36, skipping insertion in model container [2024-10-23 21:09:36,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:09:36" (1/1) ... [2024-10-23 21:09:36,231 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 21:09:36,515 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/Problem12_label54.c[4370,4383] [2024-10-23 21:09:37,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:09:37,370 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 21:09:37,399 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/Problem12_label54.c[4370,4383] [2024-10-23 21:09:37,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:09:37,804 INFO L204 MainTranslator]: Completed translation [2024-10-23 21:09:37,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:09:37 WrapperNode [2024-10-23 21:09:37,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 21:09:37,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 21:09:37,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 21:09:37,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 21:09:37,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:09:37" (1/1) ... [2024-10-23 21:09:37,875 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:09:37" (1/1) ... [2024-10-23 21:09:38,352 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-10-23 21:09:38,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 21:09:38,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 21:09:38,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 21:09:38,354 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 21:09:38,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:09:37" (1/1) ... [2024-10-23 21:09:38,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:09:37" (1/1) ... [2024-10-23 21:09:38,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:09:37" (1/1) ... [2024-10-23 21:09:38,671 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-23 21:09:38,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:09:37" (1/1) ... [2024-10-23 21:09:38,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:09:37" (1/1) ... [2024-10-23 21:09:38,813 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:09:37" (1/1) ... [2024-10-23 21:09:38,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:09:37" (1/1) ... [2024-10-23 21:09:38,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:09:37" (1/1) ... [2024-10-23 21:09:38,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:09:37" (1/1) ... [2024-10-23 21:09:38,978 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 21:09:38,980 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 21:09:38,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 21:09:38,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 21:09:38,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:09:37" (1/1) ... [2024-10-23 21:09:38,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:09:38,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:09:39,016 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-23 21:09:39,019 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-23 21:09:39,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 21:09:39,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 21:09:39,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 21:09:39,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 21:09:39,135 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 21:09:39,137 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 21:09:43,463 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-10-23 21:09:43,464 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 21:09:43,542 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 21:09:43,543 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 21:09:43,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:09:43 BoogieIcfgContainer [2024-10-23 21:09:43,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 21:09:43,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 21:09:43,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 21:09:43,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 21:09:43,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 09:09:36" (1/3) ... [2024-10-23 21:09:43,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f91958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:09:43, skipping insertion in model container [2024-10-23 21:09:43,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:09:37" (2/3) ... [2024-10-23 21:09:43,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f91958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:09:43, skipping insertion in model container [2024-10-23 21:09:43,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:09:43" (3/3) ... [2024-10-23 21:09:43,555 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label54.c [2024-10-23 21:09:43,572 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 21:09:43,572 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 21:09:43,678 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 21:09:43,685 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;@775b96cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 21:09:43,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 21:09:43,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-23 21:09:43,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:09:43,711 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] [2024-10-23 21:09:43,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:09:43,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:09:43,719 INFO L85 PathProgramCache]: Analyzing trace with hash 321369996, now seen corresponding path program 1 times [2024-10-23 21:09:43,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:09:43,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117027855] [2024-10-23 21:09:43,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:09:43,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:09:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:09:43,907 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-23 21:09:43,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:09:43,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117027855] [2024-10-23 21:09:43,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117027855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:09:43,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:09:43,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:09:43,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633741260] [2024-10-23 21:09:43,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:09:43,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 21:09:43,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:09:43,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 21:09:43,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 21:09:43,946 INFO L87 Difference]: Start difference. First operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 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 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:44,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:09:44,062 INFO L93 Difference]: Finished difference Result 1511 states and 3005 transitions. [2024-10-23 21:09:44,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 21:09:44,066 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-10-23 21:09:44,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:09:44,094 INFO L225 Difference]: With dead ends: 1511 [2024-10-23 21:09:44,095 INFO L226 Difference]: Without dead ends: 754 [2024-10-23 21:09:44,102 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-23 21:09:44,107 INFO L432 NwaCegarLoop]: 1438 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, 1438 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-23 21:09:44,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 21:09:44,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-23 21:09:44,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-10-23 21:09:44,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2024-10-23 21:09:44,186 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 32 [2024-10-23 21:09:44,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:09:44,187 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2024-10-23 21:09:44,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2024-10-23 21:09:44,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-23 21:09:44,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:09:44,189 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] [2024-10-23 21:09:44,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 21:09:44,189 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:09:44,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:09:44,190 INFO L85 PathProgramCache]: Analyzing trace with hash 750078650, now seen corresponding path program 1 times [2024-10-23 21:09:44,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:09:44,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901487826] [2024-10-23 21:09:44,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:09:44,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:09:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:09:44,475 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-23 21:09:44,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:09:44,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901487826] [2024-10-23 21:09:44,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901487826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:09:44,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:09:44,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:09:44,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999424556] [2024-10-23 21:09:44,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:09:44,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:09:44,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:09:44,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:09:44,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:09:44,481 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:50,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:09:50,016 INFO L93 Difference]: Finished difference Result 3017 states and 5755 transitions. [2024-10-23 21:09:50,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 21:09:50,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-10-23 21:09:50,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:09:50,026 INFO L225 Difference]: With dead ends: 3017 [2024-10-23 21:09:50,027 INFO L226 Difference]: Without dead ends: 2264 [2024-10-23 21:09:50,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-23 21:09:50,032 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 2377 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3613 mSolverCounterSat, 1596 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2377 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 5209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1596 IncrementalHoareTripleChecker+Valid, 3613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-23 21:09:50,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2377 Valid, 197 Invalid, 5209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1596 Valid, 3613 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-23 21:09:50,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2024-10-23 21:09:50,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2256. [2024-10-23 21:09:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2256 states, 2255 states have (on average 1.5352549889135254) internal successors, (3462), 2255 states have internal predecessors, (3462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:50,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 3462 transitions. [2024-10-23 21:09:50,104 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 3462 transitions. Word has length 32 [2024-10-23 21:09:50,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:09:50,104 INFO L471 AbstractCegarLoop]: Abstraction has 2256 states and 3462 transitions. [2024-10-23 21:09:50,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:50,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 3462 transitions. [2024-10-23 21:09:50,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-23 21:09:50,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:09:50,111 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:09:50,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 21:09:50,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:09:50,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:09:50,112 INFO L85 PathProgramCache]: Analyzing trace with hash -460640299, now seen corresponding path program 1 times [2024-10-23 21:09:50,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:09:50,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85613115] [2024-10-23 21:09:50,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:09:50,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:09:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:09:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:09:50,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:09:50,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85613115] [2024-10-23 21:09:50,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85613115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:09:50,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:09:50,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:09:50,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225886193] [2024-10-23 21:09:50,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:09:50,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:09:50,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:09:50,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:09:50,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:09:50,718 INFO L87 Difference]: Start difference. First operand 2256 states and 3462 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:54,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:09:54,602 INFO L93 Difference]: Finished difference Result 6050 states and 9663 transitions. [2024-10-23 21:09:54,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:09:54,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2024-10-23 21:09:54,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:09:54,618 INFO L225 Difference]: With dead ends: 6050 [2024-10-23 21:09:54,619 INFO L226 Difference]: Without dead ends: 3758 [2024-10-23 21:09:54,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:09:54,624 INFO L432 NwaCegarLoop]: 692 mSDtfsCounter, 702 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 3837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 3108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-23 21:09:54,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 705 Invalid, 3837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 3108 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-23 21:09:54,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2024-10-23 21:09:54,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 3758. [2024-10-23 21:09:54,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3758 states, 3757 states have (on average 1.340963534735161) internal successors, (5038), 3757 states have internal predecessors, (5038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:54,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3758 states to 3758 states and 5038 transitions. [2024-10-23 21:09:54,717 INFO L78 Accepts]: Start accepts. Automaton has 3758 states and 5038 transitions. Word has length 172 [2024-10-23 21:09:54,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:09:54,718 INFO L471 AbstractCegarLoop]: Abstraction has 3758 states and 5038 transitions. [2024-10-23 21:09:54,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:54,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3758 states and 5038 transitions. [2024-10-23 21:09:54,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-23 21:09:54,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:09:54,729 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:09:54,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 21:09:54,729 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:09:54,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:09:54,733 INFO L85 PathProgramCache]: Analyzing trace with hash -729375258, now seen corresponding path program 1 times [2024-10-23 21:09:54,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:09:54,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310773199] [2024-10-23 21:09:54,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:09:54,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:09:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:09:55,054 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-23 21:09:55,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:09:55,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310773199] [2024-10-23 21:09:55,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310773199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:09:55,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:09:55,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:09:55,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745271462] [2024-10-23 21:09:55,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:09:55,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:09:55,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:09:55,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:09:55,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:09:55,059 INFO L87 Difference]: Start difference. First operand 3758 states and 5038 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:57,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:09:57,508 INFO L93 Difference]: Finished difference Result 10519 states and 14355 transitions. [2024-10-23 21:09:57,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:09:57,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 242 [2024-10-23 21:09:57,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:09:57,531 INFO L225 Difference]: With dead ends: 10519 [2024-10-23 21:09:57,531 INFO L226 Difference]: Without dead ends: 6762 [2024-10-23 21:09:57,539 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-23 21:09:57,540 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 669 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 845 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 845 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:09:57,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 484 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [845 Valid, 1990 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-23 21:09:57,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6762 states. [2024-10-23 21:09:57,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6762 to 6011. [2024-10-23 21:09:57,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6011 states, 6010 states have (on average 1.2815307820299502) internal successors, (7702), 6010 states have internal predecessors, (7702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6011 states to 6011 states and 7702 transitions. [2024-10-23 21:09:57,651 INFO L78 Accepts]: Start accepts. Automaton has 6011 states and 7702 transitions. Word has length 242 [2024-10-23 21:09:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:09:57,653 INFO L471 AbstractCegarLoop]: Abstraction has 6011 states and 7702 transitions. [2024-10-23 21:09:57,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:09:57,654 INFO L276 IsEmpty]: Start isEmpty. Operand 6011 states and 7702 transitions. [2024-10-23 21:09:57,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-10-23 21:09:57,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:09:57,658 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:09:57,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 21:09:57,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:09:57,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:09:57,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1221732457, now seen corresponding path program 1 times [2024-10-23 21:09:57,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:09:57,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488971061] [2024-10-23 21:09:57,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:09:57,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:09:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:09:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 61 proven. 54 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-23 21:09:58,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:09:58,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488971061] [2024-10-23 21:09:58,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488971061] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:09:58,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565225535] [2024-10-23 21:09:58,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:09:58,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:09:58,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:09:58,109 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-23 21:09:58,110 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-23 21:09:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:09:58,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 21:09:58,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:09:58,395 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:09:58,395 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:09:58,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565225535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:09:58,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:09:58,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-23 21:09:58,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036255101] [2024-10-23 21:09:58,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:09:58,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:09:58,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:09:58,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:09:58,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-23 21:09:58,398 INFO L87 Difference]: Start difference. First operand 6011 states and 7702 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:00,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:10:00,920 INFO L93 Difference]: Finished difference Result 15025 states and 19933 transitions. [2024-10-23 21:10:00,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:10:00,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 255 [2024-10-23 21:10:00,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:10:00,945 INFO L225 Difference]: With dead ends: 15025 [2024-10-23 21:10:00,946 INFO L226 Difference]: Without dead ends: 9015 [2024-10-23 21:10:00,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-23 21:10:00,956 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 907 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2073 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 2073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:10:00,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 307 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 2073 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-23 21:10:00,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9015 states. [2024-10-23 21:10:01,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9015 to 9015. [2024-10-23 21:10:01,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9015 states, 9014 states have (on average 1.265808741956956) internal successors, (11410), 9014 states have internal predecessors, (11410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:01,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9015 states to 9015 states and 11410 transitions. [2024-10-23 21:10:01,112 INFO L78 Accepts]: Start accepts. Automaton has 9015 states and 11410 transitions. Word has length 255 [2024-10-23 21:10:01,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:10:01,112 INFO L471 AbstractCegarLoop]: Abstraction has 9015 states and 11410 transitions. [2024-10-23 21:10:01,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:01,113 INFO L276 IsEmpty]: Start isEmpty. Operand 9015 states and 11410 transitions. [2024-10-23 21:10:01,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-10-23 21:10:01,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:10:01,116 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:10:01,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-23 21:10:01,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:10:01,317 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:10:01,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:10:01,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1383660433, now seen corresponding path program 1 times [2024-10-23 21:10:01,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:10:01,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421286637] [2024-10-23 21:10:01,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:10:01,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:10:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:10:01,573 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-23 21:10:01,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:10:01,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421286637] [2024-10-23 21:10:01,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421286637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:10:01,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:10:01,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:10:01,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025342677] [2024-10-23 21:10:01,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:10:01,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:10:01,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:10:01,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:10:01,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:10:01,576 INFO L87 Difference]: Start difference. First operand 9015 states and 11410 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:04,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:10:04,329 INFO L93 Difference]: Finished difference Result 21784 states and 27826 transitions. [2024-10-23 21:10:04,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:10:04,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272 [2024-10-23 21:10:04,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:10:04,363 INFO L225 Difference]: With dead ends: 21784 [2024-10-23 21:10:04,364 INFO L226 Difference]: Without dead ends: 12770 [2024-10-23 21:10:04,373 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-23 21:10:04,374 INFO L432 NwaCegarLoop]: 1206 mSDtfsCounter, 742 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2255 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 2255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:10:04,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 1213 Invalid, 2780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [525 Valid, 2255 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-23 21:10:04,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12770 states. [2024-10-23 21:10:04,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12770 to 12770. [2024-10-23 21:10:04,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12770 states, 12769 states have (on average 1.1838828412561673) internal successors, (15117), 12769 states have internal predecessors, (15117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:04,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12770 states to 12770 states and 15117 transitions. [2024-10-23 21:10:04,561 INFO L78 Accepts]: Start accepts. Automaton has 12770 states and 15117 transitions. Word has length 272 [2024-10-23 21:10:04,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:10:04,561 INFO L471 AbstractCegarLoop]: Abstraction has 12770 states and 15117 transitions. [2024-10-23 21:10:04,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:04,562 INFO L276 IsEmpty]: Start isEmpty. Operand 12770 states and 15117 transitions. [2024-10-23 21:10:04,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-10-23 21:10:04,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:10:04,572 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-23 21:10:04,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 21:10:04,574 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:10:04,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:10:04,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1246266559, now seen corresponding path program 1 times [2024-10-23 21:10:04,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:10:04,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535805255] [2024-10-23 21:10:04,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:10:04,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:10:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:10:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-23 21:10:04,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:10:04,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535805255] [2024-10-23 21:10:04,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535805255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:10:04,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:10:04,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:10:04,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080158293] [2024-10-23 21:10:04,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:10:04,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:10:04,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:10:04,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:10:04,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:10:04,880 INFO L87 Difference]: Start difference. First operand 12770 states and 15117 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:10:07,786 INFO L93 Difference]: Finished difference Result 36053 states and 43061 transitions. [2024-10-23 21:10:07,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:10:07,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 359 [2024-10-23 21:10:07,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:10:07,828 INFO L225 Difference]: With dead ends: 36053 [2024-10-23 21:10:07,828 INFO L226 Difference]: Without dead ends: 23284 [2024-10-23 21:10:07,841 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-23 21:10:07,842 INFO L432 NwaCegarLoop]: 1213 mSDtfsCounter, 639 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2608 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 3005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 2608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:10:07,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1220 Invalid, 3005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 2608 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-23 21:10:07,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23284 states. [2024-10-23 21:10:08,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23284 to 22533. [2024-10-23 21:10:08,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22533 states, 22532 states have (on average 1.172022013136872) internal successors, (26408), 22532 states have internal predecessors, (26408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:08,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22533 states to 22533 states and 26408 transitions. [2024-10-23 21:10:08,197 INFO L78 Accepts]: Start accepts. Automaton has 22533 states and 26408 transitions. Word has length 359 [2024-10-23 21:10:08,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:10:08,197 INFO L471 AbstractCegarLoop]: Abstraction has 22533 states and 26408 transitions. [2024-10-23 21:10:08,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:08,198 INFO L276 IsEmpty]: Start isEmpty. Operand 22533 states and 26408 transitions. [2024-10-23 21:10:08,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-10-23 21:10:08,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:10:08,205 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:10:08,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 21:10:08,205 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:10:08,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:10:08,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1409445749, now seen corresponding path program 1 times [2024-10-23 21:10:08,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:10:08,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676310577] [2024-10-23 21:10:08,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:10:08,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:10:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:10:08,472 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-23 21:10:08,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:10:08,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676310577] [2024-10-23 21:10:08,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676310577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:10:08,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:10:08,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:10:08,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553805241] [2024-10-23 21:10:08,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:10:08,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:10:08,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:10:08,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:10:08,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:10:08,475 INFO L87 Difference]: Start difference. First operand 22533 states and 26408 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-23 21:10:10,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:10:10,645 INFO L93 Difference]: Finished difference Result 51073 states and 59607 transitions. [2024-10-23 21:10:10,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:10:10,646 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 363 [2024-10-23 21:10:10,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:10:10,694 INFO L225 Difference]: With dead ends: 51073 [2024-10-23 21:10:10,694 INFO L226 Difference]: Without dead ends: 25537 [2024-10-23 21:10:10,867 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-23 21:10:10,867 INFO L432 NwaCegarLoop]: 1377 mSDtfsCounter, 734 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 2396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-23 21:10:10,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1384 Invalid, 2396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1998 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-23 21:10:10,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25537 states. [2024-10-23 21:10:11,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25537 to 25537. [2024-10-23 21:10:11,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25537 states, 25536 states have (on average 1.1246867167919798) internal successors, (28720), 25536 states have internal predecessors, (28720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25537 states to 25537 states and 28720 transitions. [2024-10-23 21:10:11,120 INFO L78 Accepts]: Start accepts. Automaton has 25537 states and 28720 transitions. Word has length 363 [2024-10-23 21:10:11,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:10:11,121 INFO L471 AbstractCegarLoop]: Abstraction has 25537 states and 28720 transitions. [2024-10-23 21:10:11,121 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-23 21:10:11,121 INFO L276 IsEmpty]: Start isEmpty. Operand 25537 states and 28720 transitions. [2024-10-23 21:10:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-10-23 21:10:11,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:10:11,125 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-23 21:10:11,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-23 21:10:11,125 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:10:11,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:10:11,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1431863103, now seen corresponding path program 1 times [2024-10-23 21:10:11,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:10:11,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573901192] [2024-10-23 21:10:11,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:10:11,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:10:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:10:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 439 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-10-23 21:10:11,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:10:11,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573901192] [2024-10-23 21:10:11,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573901192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:10:11,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:10:11,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:10:11,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700762176] [2024-10-23 21:10:11,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:10:11,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:10:11,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:10:11,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:10:11,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:10:11,390 INFO L87 Difference]: Start difference. First operand 25537 states and 28720 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:13,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:10:13,664 INFO L93 Difference]: Finished difference Result 51073 states and 57439 transitions. [2024-10-23 21:10:13,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:10:13,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 393 [2024-10-23 21:10:13,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:10:13,704 INFO L225 Difference]: With dead ends: 51073 [2024-10-23 21:10:13,704 INFO L226 Difference]: Without dead ends: 25537 [2024-10-23 21:10:13,725 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-23 21:10:13,725 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 721 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2149 mSolverCounterSat, 455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 2604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 455 IncrementalHoareTripleChecker+Valid, 2149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-23 21:10:13,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 201 Invalid, 2604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [455 Valid, 2149 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-23 21:10:13,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25537 states. [2024-10-23 21:10:14,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25537 to 25537. [2024-10-23 21:10:14,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25537 states, 25536 states have (on average 1.115875626566416) internal successors, (28495), 25536 states have internal predecessors, (28495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:14,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25537 states to 25537 states and 28495 transitions. [2024-10-23 21:10:14,105 INFO L78 Accepts]: Start accepts. Automaton has 25537 states and 28495 transitions. Word has length 393 [2024-10-23 21:10:14,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:10:14,105 INFO L471 AbstractCegarLoop]: Abstraction has 25537 states and 28495 transitions. [2024-10-23 21:10:14,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:14,106 INFO L276 IsEmpty]: Start isEmpty. Operand 25537 states and 28495 transitions. [2024-10-23 21:10:14,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2024-10-23 21:10:14,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:10:14,111 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-23 21:10:14,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-23 21:10:14,111 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:10:14,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:10:14,112 INFO L85 PathProgramCache]: Analyzing trace with hash -2138781087, now seen corresponding path program 1 times [2024-10-23 21:10:14,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:10:14,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194444631] [2024-10-23 21:10:14,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:10:14,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:10:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:10:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 439 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-23 21:10:14,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:10:14,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194444631] [2024-10-23 21:10:14,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194444631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:10:14,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:10:14,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:10:14,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720417923] [2024-10-23 21:10:14,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:10:14,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:10:14,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:10:14,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:10:14,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:10:14,332 INFO L87 Difference]: Start difference. First operand 25537 states and 28495 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:16,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:10:16,856 INFO L93 Difference]: Finished difference Result 69097 states and 77627 transitions. [2024-10-23 21:10:16,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:10:16,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 404 [2024-10-23 21:10:16,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:10:16,920 INFO L225 Difference]: With dead ends: 69097 [2024-10-23 21:10:16,920 INFO L226 Difference]: Without dead ends: 43561 [2024-10-23 21:10:16,947 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-23 21:10:16,950 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 686 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2165 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 2165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-23 21:10:16,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 439 Invalid, 2626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 2165 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-23 21:10:16,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43561 states. [2024-10-23 21:10:17,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43561 to 42810. [2024-10-23 21:10:17,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42810 states, 42809 states have (on average 1.1068700506902753) internal successors, (47384), 42809 states have internal predecessors, (47384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42810 states to 42810 states and 47384 transitions. [2024-10-23 21:10:17,567 INFO L78 Accepts]: Start accepts. Automaton has 42810 states and 47384 transitions. Word has length 404 [2024-10-23 21:10:17,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:10:17,568 INFO L471 AbstractCegarLoop]: Abstraction has 42810 states and 47384 transitions. [2024-10-23 21:10:17,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:17,568 INFO L276 IsEmpty]: Start isEmpty. Operand 42810 states and 47384 transitions. [2024-10-23 21:10:17,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2024-10-23 21:10:17,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:10:17,576 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:10:17,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-23 21:10:17,576 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:10:17,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:10:17,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1075533492, now seen corresponding path program 1 times [2024-10-23 21:10:17,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:10:17,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905187124] [2024-10-23 21:10:17,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:10:17,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:10:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:10:17,937 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 403 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2024-10-23 21:10:17,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:10:17,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905187124] [2024-10-23 21:10:17,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905187124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:10:17,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:10:17,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:10:17,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770119734] [2024-10-23 21:10:17,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:10:17,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:10:17,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:10:17,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:10:17,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:10:17,940 INFO L87 Difference]: Start difference. First operand 42810 states and 47384 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:10:20,712 INFO L93 Difference]: Finished difference Result 99888 states and 110751 transitions. [2024-10-23 21:10:20,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:10:20,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 431 [2024-10-23 21:10:20,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:10:20,798 INFO L225 Difference]: With dead ends: 99888 [2024-10-23 21:10:20,799 INFO L226 Difference]: Without dead ends: 57079 [2024-10-23 21:10:20,837 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-23 21:10:20,838 INFO L432 NwaCegarLoop]: 1171 mSDtfsCounter, 689 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2107 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 2540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 2107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-23 21:10:20,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1178 Invalid, 2540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 2107 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-23 21:10:20,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57079 states. [2024-10-23 21:10:21,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57079 to 55577. [2024-10-23 21:10:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55577 states, 55576 states have (on average 1.0885454152871743) internal successors, (60497), 55576 states have internal predecessors, (60497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55577 states to 55577 states and 60497 transitions. [2024-10-23 21:10:21,554 INFO L78 Accepts]: Start accepts. Automaton has 55577 states and 60497 transitions. Word has length 431 [2024-10-23 21:10:21,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:10:21,555 INFO L471 AbstractCegarLoop]: Abstraction has 55577 states and 60497 transitions. [2024-10-23 21:10:21,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:21,556 INFO L276 IsEmpty]: Start isEmpty. Operand 55577 states and 60497 transitions. [2024-10-23 21:10:21,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2024-10-23 21:10:21,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:10:21,577 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:10:21,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-23 21:10:21,577 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:10:21,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:10:21,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1691318238, now seen corresponding path program 1 times [2024-10-23 21:10:21,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:10:21,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062455228] [2024-10-23 21:10:21,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:10:21,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:10:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:10:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 669 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2024-10-23 21:10:21,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:10:21,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062455228] [2024-10-23 21:10:21,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062455228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:10:21,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:10:21,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:10:21,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528848546] [2024-10-23 21:10:21,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:10:21,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:10:21,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:10:21,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:10:21,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:10:21,976 INFO L87 Difference]: Start difference. First operand 55577 states and 60497 transitions. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:25,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:10:25,002 INFO L93 Difference]: Finished difference Result 134434 states and 145933 transitions. [2024-10-23 21:10:25,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:10:25,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 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 627 [2024-10-23 21:10:25,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:10:25,108 INFO L225 Difference]: With dead ends: 134434 [2024-10-23 21:10:25,108 INFO L226 Difference]: Without dead ends: 78858 [2024-10-23 21:10:25,141 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-23 21:10:25,142 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 722 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 2486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:10:25,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 281 Invalid, 2486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-23 21:10:25,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78858 states. [2024-10-23 21:10:25,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78858 to 75854. [2024-10-23 21:10:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75854 states, 75853 states have (on average 1.071124411691034) internal successors, (81248), 75853 states have internal predecessors, (81248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:26,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75854 states to 75854 states and 81248 transitions. [2024-10-23 21:10:26,230 INFO L78 Accepts]: Start accepts. Automaton has 75854 states and 81248 transitions. Word has length 627 [2024-10-23 21:10:26,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:10:26,231 INFO L471 AbstractCegarLoop]: Abstraction has 75854 states and 81248 transitions. [2024-10-23 21:10:26,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:26,232 INFO L276 IsEmpty]: Start isEmpty. Operand 75854 states and 81248 transitions. [2024-10-23 21:10:26,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2024-10-23 21:10:26,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:10:26,264 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:10:26,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-23 21:10:26,264 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:10:26,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:10:26,265 INFO L85 PathProgramCache]: Analyzing trace with hash 481729901, now seen corresponding path program 1 times [2024-10-23 21:10:26,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:10:26,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169645687] [2024-10-23 21:10:26,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:10:26,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:10:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:10:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-23 21:10:26,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:10:26,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169645687] [2024-10-23 21:10:26,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169645687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:10:26,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:10:26,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:10:26,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200962376] [2024-10-23 21:10:26,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:10:26,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:10:26,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:10:26,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:10:26,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:10:26,926 INFO L87 Difference]: Start difference. First operand 75854 states and 81248 transitions. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:10:29,579 INFO L93 Difference]: Finished difference Result 165225 states and 177573 transitions. [2024-10-23 21:10:29,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:10:29,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 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 649 [2024-10-23 21:10:29,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:10:29,679 INFO L225 Difference]: With dead ends: 165225 [2024-10-23 21:10:29,679 INFO L226 Difference]: Without dead ends: 89372 [2024-10-23 21:10:29,720 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-23 21:10:29,721 INFO L432 NwaCegarLoop]: 1153 mSDtfsCounter, 413 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2066 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 2413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 2066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-23 21:10:29,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1160 Invalid, 2413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 2066 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-23 21:10:29,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89372 states. [2024-10-23 21:10:30,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89372 to 89372. [2024-10-23 21:10:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89372 states, 89371 states have (on average 1.06010898389858) internal successors, (94743), 89371 states have internal predecessors, (94743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:31,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89372 states to 89372 states and 94743 transitions. [2024-10-23 21:10:31,100 INFO L78 Accepts]: Start accepts. Automaton has 89372 states and 94743 transitions. Word has length 649 [2024-10-23 21:10:31,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:10:31,101 INFO L471 AbstractCegarLoop]: Abstraction has 89372 states and 94743 transitions. [2024-10-23 21:10:31,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:31,101 INFO L276 IsEmpty]: Start isEmpty. Operand 89372 states and 94743 transitions. [2024-10-23 21:10:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2024-10-23 21:10:31,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:10:31,136 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:10:31,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-23 21:10:31,136 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:10:31,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:10:31,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1085214576, now seen corresponding path program 1 times [2024-10-23 21:10:31,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:10:31,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787256926] [2024-10-23 21:10:31,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:10:31,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:10:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:10:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 705 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-10-23 21:10:31,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:10:31,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787256926] [2024-10-23 21:10:31,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787256926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:10:31,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:10:31,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:10:31,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532691653] [2024-10-23 21:10:31,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:10:31,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:10:31,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:10:31,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:10:31,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:10:31,633 INFO L87 Difference]: Start difference. First operand 89372 states and 94743 transitions. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:34,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:10:34,477 INFO L93 Difference]: Finished difference Result 212538 states and 225660 transitions. [2024-10-23 21:10:34,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:10:34,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 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 729 [2024-10-23 21:10:34,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:10:34,636 INFO L225 Difference]: With dead ends: 212538 [2024-10-23 21:10:34,637 INFO L226 Difference]: Without dead ends: 123167 [2024-10-23 21:10:34,699 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-23 21:10:34,700 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 669 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2150 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 2680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 2150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-23 21:10:34,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 218 Invalid, 2680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 2150 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-23 21:10:34,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123167 states. [2024-10-23 21:10:36,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123167 to 109649. [2024-10-23 21:10:36,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109649 states, 109648 states have (on average 1.0639409747555815) internal successors, (116659), 109648 states have internal predecessors, (116659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:36,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109649 states to 109649 states and 116659 transitions. [2024-10-23 21:10:36,294 INFO L78 Accepts]: Start accepts. Automaton has 109649 states and 116659 transitions. Word has length 729 [2024-10-23 21:10:36,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:10:36,294 INFO L471 AbstractCegarLoop]: Abstraction has 109649 states and 116659 transitions. [2024-10-23 21:10:36,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:36,294 INFO L276 IsEmpty]: Start isEmpty. Operand 109649 states and 116659 transitions. [2024-10-23 21:10:36,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2024-10-23 21:10:36,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:10:36,319 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:10:36,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-23 21:10:36,320 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:10:36,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:10:36,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2056537064, now seen corresponding path program 1 times [2024-10-23 21:10:36,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:10:36,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204445144] [2024-10-23 21:10:36,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:10:36,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:10:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:10:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 733 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2024-10-23 21:10:37,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:10:37,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204445144] [2024-10-23 21:10:37,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204445144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:10:37,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:10:37,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:10:37,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73927340] [2024-10-23 21:10:37,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:10:37,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:10:37,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:10:37,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:10:37,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:10:37,382 INFO L87 Difference]: Start difference. First operand 109649 states and 116659 transitions. Second operand has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:10:40,201 INFO L93 Difference]: Finished difference Result 221550 states and 235609 transitions. [2024-10-23 21:10:40,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:10:40,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 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 790 [2024-10-23 21:10:40,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:10:40,349 INFO L225 Difference]: With dead ends: 221550 [2024-10-23 21:10:40,349 INFO L226 Difference]: Without dead ends: 111902 [2024-10-23 21:10:40,425 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-23 21:10:40,426 INFO L432 NwaCegarLoop]: 1156 mSDtfsCounter, 590 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2212 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 2350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 2212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-23 21:10:40,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1163 Invalid, 2350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 2212 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-23 21:10:40,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111902 states. [2024-10-23 21:10:41,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111902 to 111151. [2024-10-23 21:10:41,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111151 states, 111150 states have (on average 1.0616644174538912) internal successors, (118004), 111150 states have internal predecessors, (118004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111151 states to 111151 states and 118004 transitions. [2024-10-23 21:10:42,021 INFO L78 Accepts]: Start accepts. Automaton has 111151 states and 118004 transitions. Word has length 790 [2024-10-23 21:10:42,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:10:42,021 INFO L471 AbstractCegarLoop]: Abstraction has 111151 states and 118004 transitions. [2024-10-23 21:10:42,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:42,022 INFO L276 IsEmpty]: Start isEmpty. Operand 111151 states and 118004 transitions. [2024-10-23 21:10:42,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 799 [2024-10-23 21:10:42,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:10:42,052 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:10:42,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-23 21:10:42,052 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:10:42,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:10:42,053 INFO L85 PathProgramCache]: Analyzing trace with hash 937532742, now seen corresponding path program 1 times [2024-10-23 21:10:42,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:10:42,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190577380] [2024-10-23 21:10:42,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:10:42,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:10:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:10:42,765 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-23 21:10:42,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:10:42,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190577380] [2024-10-23 21:10:42,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190577380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:10:42,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:10:42,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:10:42,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293986987] [2024-10-23 21:10:42,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:10:42,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:10:42,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:10:42,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:10:42,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:10:42,768 INFO L87 Difference]: Start difference. First operand 111151 states and 118004 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:45,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:10:45,384 INFO L93 Difference]: Finished difference Result 222301 states and 236007 transitions. [2024-10-23 21:10:45,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:10:45,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 798 [2024-10-23 21:10:45,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:10:45,519 INFO L225 Difference]: With dead ends: 222301 [2024-10-23 21:10:45,519 INFO L226 Difference]: Without dead ends: 111151 [2024-10-23 21:10:45,555 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-23 21:10:45,556 INFO L432 NwaCegarLoop]: 1194 mSDtfsCounter, 757 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1933 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 2206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 1933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-23 21:10:45,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 1201 Invalid, 2206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 1933 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-23 21:10:45,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111151 states. [2024-10-23 21:10:46,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111151 to 107396. [2024-10-23 21:10:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107396 states, 107395 states have (on average 1.0469016248428697) internal successors, (112432), 107395 states have internal predecessors, (112432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:47,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107396 states to 107396 states and 112432 transitions. [2024-10-23 21:10:47,064 INFO L78 Accepts]: Start accepts. Automaton has 107396 states and 112432 transitions. Word has length 798 [2024-10-23 21:10:47,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:10:47,065 INFO L471 AbstractCegarLoop]: Abstraction has 107396 states and 112432 transitions. [2024-10-23 21:10:47,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:10:47,065 INFO L276 IsEmpty]: Start isEmpty. Operand 107396 states and 112432 transitions. [2024-10-23 21:10:47,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 977 [2024-10-23 21:10:47,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:10:47,123 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:10:47,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-23 21:10:47,123 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:10:47,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:10:47,124 INFO L85 PathProgramCache]: Analyzing trace with hash -428336864, now seen corresponding path program 1 times [2024-10-23 21:10:47,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:10:47,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219571015] [2024-10-23 21:10:47,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:10:47,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:10:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:10:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2024-10-23 21:10:48,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:10:48,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219571015] [2024-10-23 21:10:48,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219571015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:10:48,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:10:48,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:10:48,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052936497] [2024-10-23 21:10:48,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:10:48,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:10:48,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:10:48,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:10:48,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:10:48,013 INFO L87 Difference]: Start difference. First operand 107396 states and 112432 transitions. Second operand has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)