./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.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 d7923672572112c1e23e765d37ba0d9265e37954a51bbbf4393296aaafd9ce3e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:22:19,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:22:19,388 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:22:19,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:22:19,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:22:19,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:22:19,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:22:19,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:22:19,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:22:19,418 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:22:19,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:22:19,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:22:19,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:22:19,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:22:19,420 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:22:19,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:22:19,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:22:19,421 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:22:19,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:22:19,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:22:19,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:22:19,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:22:19,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:22:19,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:22:19,423 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:22:19,423 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:22:19,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:22:19,424 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:22:19,424 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:22:19,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:22:19,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:22:19,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:22:19,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:22:19,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:22:19,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:22:19,427 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:22:19,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:22:19,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:22:19,428 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:22:19,428 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:22:19,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:22:19,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:22:19,429 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 -> d7923672572112c1e23e765d37ba0d9265e37954a51bbbf4393296aaafd9ce3e [2024-10-12 20:22:19,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:22:19,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:22:19,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:22:19,721 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:22:19,721 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:22:19,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-12 20:22:21,170 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:22:21,562 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:22:21,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-12 20:22:21,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1ee9434f/cefd62e8b9104cc78b293768029c8a2b/FLAG4e5a46117 [2024-10-12 20:22:21,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1ee9434f/cefd62e8b9104cc78b293768029c8a2b [2024-10-12 20:22:21,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:22:21,752 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:22:21,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:22:21,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:22:21,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:22:21,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:22:21" (1/1) ... [2024-10-12 20:22:21,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@599311ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:21, skipping insertion in model container [2024-10-12 20:22:21,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:22:21" (1/1) ... [2024-10-12 20:22:21,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:22:22,174 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/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[9988,10001] [2024-10-12 20:22:22,246 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/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24517,24530] [2024-10-12 20:22:22,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:22:22,480 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:22:22,567 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/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[9988,10001] [2024-10-12 20:22:22,646 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/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24517,24530] [2024-10-12 20:22:22,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:22:22,775 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:22:22,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:22 WrapperNode [2024-10-12 20:22:22,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:22:22,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:22:22,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:22:22,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:22:22,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:22" (1/1) ... [2024-10-12 20:22:22,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:22" (1/1) ... [2024-10-12 20:22:22,946 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3648 [2024-10-12 20:22:22,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:22:22,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:22:22,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:22:22,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:22:22,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:22" (1/1) ... [2024-10-12 20:22:22,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:22" (1/1) ... [2024-10-12 20:22:22,993 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:22" (1/1) ... [2024-10-12 20:22:23,063 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 20:22:23,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:22" (1/1) ... [2024-10-12 20:22:23,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:22" (1/1) ... [2024-10-12 20:22:23,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:22" (1/1) ... [2024-10-12 20:22:23,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:22" (1/1) ... [2024-10-12 20:22:23,164 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:22" (1/1) ... [2024-10-12 20:22:23,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:22" (1/1) ... [2024-10-12 20:22:23,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:22:23,203 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:22:23,203 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:22:23,203 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:22:23,204 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:22" (1/1) ... [2024-10-12 20:22:23,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:22:23,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:22:23,239 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:22:23,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:22:23,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:22:23,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:22:23,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:22:23,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:22:23,515 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:22:23,518 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:22:25,498 INFO L? ?]: Removed 517 outVars from TransFormulas that were not future-live. [2024-10-12 20:22:25,498 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:22:25,565 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:22:25,566 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:22:25,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:22:25 BoogieIcfgContainer [2024-10-12 20:22:25,566 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:22:25,568 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:22:25,568 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:22:25,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:22:25,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:22:21" (1/3) ... [2024-10-12 20:22:25,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452f7d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:22:25, skipping insertion in model container [2024-10-12 20:22:25,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:22:22" (2/3) ... [2024-10-12 20:22:25,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452f7d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:22:25, skipping insertion in model container [2024-10-12 20:22:25,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:22:25" (3/3) ... [2024-10-12 20:22:25,576 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-12 20:22:25,594 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:22:25,594 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 20:22:25,694 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:22:25,703 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;@2e63d298, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:22:25,703 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 20:22:25,712 INFO L276 IsEmpty]: Start isEmpty. Operand has 700 states, 697 states have (on average 1.787661406025825) internal successors, (1246), 699 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:25,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:22:25,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:25,732 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:25,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:25,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:25,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1229301387, now seen corresponding path program 1 times [2024-10-12 20:22:25,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:25,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146723016] [2024-10-12 20:22:25,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:25,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:26,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:26,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146723016] [2024-10-12 20:22:26,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146723016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:26,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:26,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:22:26,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405292767] [2024-10-12 20:22:26,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:26,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:22:26,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:26,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:22:26,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:26,245 INFO L87 Difference]: Start difference. First operand has 700 states, 697 states have (on average 1.787661406025825) internal successors, (1246), 699 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:26,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:26,411 INFO L93 Difference]: Finished difference Result 1059 states and 1845 transitions. [2024-10-12 20:22:26,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:22:26,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-10-12 20:22:26,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:26,436 INFO L225 Difference]: With dead ends: 1059 [2024-10-12 20:22:26,436 INFO L226 Difference]: Without dead ends: 841 [2024-10-12 20:22:26,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:26,444 INFO L432 NwaCegarLoop]: 1240 mSDtfsCounter, 629 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 2063 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:26,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 2063 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:22:26,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2024-10-12 20:22:26,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 839. [2024-10-12 20:22:26,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 837 states have (on average 1.3727598566308243) internal successors, (1149), 838 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:26,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1149 transitions. [2024-10-12 20:22:26,517 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1149 transitions. Word has length 61 [2024-10-12 20:22:26,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:26,517 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1149 transitions. [2024-10-12 20:22:26,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:26,518 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1149 transitions. [2024-10-12 20:22:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 20:22:26,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:26,525 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:26,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:22:26,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:26,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:26,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1202740473, now seen corresponding path program 1 times [2024-10-12 20:22:26,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:26,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215555374] [2024-10-12 20:22:26,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:26,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:26,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:26,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:26,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215555374] [2024-10-12 20:22:26,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215555374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:26,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:26,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:22:26,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602294118] [2024-10-12 20:22:26,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:26,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:22:26,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:26,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:22:26,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:26,712 INFO L87 Difference]: Start difference. First operand 839 states and 1149 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:26,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:26,852 INFO L93 Difference]: Finished difference Result 1460 states and 2021 transitions. [2024-10-12 20:22:26,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:22:26,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-12 20:22:26,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:26,862 INFO L225 Difference]: With dead ends: 1460 [2024-10-12 20:22:26,862 INFO L226 Difference]: Without dead ends: 1220 [2024-10-12 20:22:26,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:26,868 INFO L432 NwaCegarLoop]: 1032 mSDtfsCounter, 548 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:26,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1677 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:22:26,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2024-10-12 20:22:26,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1216. [2024-10-12 20:22:26,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1214 states have (on average 1.3599670510708401) internal successors, (1651), 1215 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:26,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1651 transitions. [2024-10-12 20:22:26,907 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1651 transitions. Word has length 62 [2024-10-12 20:22:26,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:26,908 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1651 transitions. [2024-10-12 20:22:26,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:26,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1651 transitions. [2024-10-12 20:22:26,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 20:22:26,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:26,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:26,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:22:26,914 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:26,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:26,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1419941485, now seen corresponding path program 1 times [2024-10-12 20:22:26,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:26,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450797384] [2024-10-12 20:22:26,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:26,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:27,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:27,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:27,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450797384] [2024-10-12 20:22:27,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450797384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:27,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:27,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:22:27,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325446106] [2024-10-12 20:22:27,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:27,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:22:27,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:27,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:22:27,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:27,053 INFO L87 Difference]: Start difference. First operand 1216 states and 1651 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:27,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:27,117 INFO L93 Difference]: Finished difference Result 2214 states and 3113 transitions. [2024-10-12 20:22:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:22:27,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-12 20:22:27,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:27,125 INFO L225 Difference]: With dead ends: 2214 [2024-10-12 20:22:27,125 INFO L226 Difference]: Without dead ends: 1683 [2024-10-12 20:22:27,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:27,131 INFO L432 NwaCegarLoop]: 945 mSDtfsCounter, 493 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:27,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 1574 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:22:27,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2024-10-12 20:22:27,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1679. [2024-10-12 20:22:27,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1679 states, 1677 states have (on average 1.3792486583184258) internal successors, (2313), 1678 states have internal predecessors, (2313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2313 transitions. [2024-10-12 20:22:27,164 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 2313 transitions. Word has length 62 [2024-10-12 20:22:27,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:27,166 INFO L471 AbstractCegarLoop]: Abstraction has 1679 states and 2313 transitions. [2024-10-12 20:22:27,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:27,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2313 transitions. [2024-10-12 20:22:27,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 20:22:27,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:27,169 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:27,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:22:27,170 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:27,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:27,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1452563052, now seen corresponding path program 1 times [2024-10-12 20:22:27,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:27,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436136655] [2024-10-12 20:22:27,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:27,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:27,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:27,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436136655] [2024-10-12 20:22:27,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436136655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:27,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:27,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:22:27,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712043332] [2024-10-12 20:22:27,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:27,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:22:27,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:27,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:22:27,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:22:27,393 INFO L87 Difference]: Start difference. First operand 1679 states and 2313 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:27,944 INFO L93 Difference]: Finished difference Result 3708 states and 5232 transitions. [2024-10-12 20:22:27,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:22:27,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-12 20:22:27,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:27,953 INFO L225 Difference]: With dead ends: 3708 [2024-10-12 20:22:27,954 INFO L226 Difference]: Without dead ends: 2252 [2024-10-12 20:22:27,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:22:27,958 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 2605 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2605 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:27,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2605 Valid, 572 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:22:27,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2024-10-12 20:22:28,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2250. [2024-10-12 20:22:28,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2250 states, 2248 states have (on average 1.4105871886120998) internal successors, (3171), 2249 states have internal predecessors, (3171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:28,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 3171 transitions. [2024-10-12 20:22:28,012 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 3171 transitions. Word has length 62 [2024-10-12 20:22:28,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:28,013 INFO L471 AbstractCegarLoop]: Abstraction has 2250 states and 3171 transitions. [2024-10-12 20:22:28,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:28,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 3171 transitions. [2024-10-12 20:22:28,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-12 20:22:28,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:28,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:28,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:22:28,017 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:28,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:28,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1875740527, now seen corresponding path program 1 times [2024-10-12 20:22:28,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:28,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338544045] [2024-10-12 20:22:28,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:28,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:28,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:28,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:28,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338544045] [2024-10-12 20:22:28,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338544045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:28,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:28,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:22:28,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321336161] [2024-10-12 20:22:28,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:28,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:22:28,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:28,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:22:28,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:28,120 INFO L87 Difference]: Start difference. First operand 2250 states and 3171 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:28,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:28,173 INFO L93 Difference]: Finished difference Result 4647 states and 6626 transitions. [2024-10-12 20:22:28,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:22:28,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-10-12 20:22:28,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:28,184 INFO L225 Difference]: With dead ends: 4647 [2024-10-12 20:22:28,185 INFO L226 Difference]: Without dead ends: 3137 [2024-10-12 20:22:28,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:28,191 INFO L432 NwaCegarLoop]: 944 mSDtfsCounter, 578 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:28,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 1478 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:22:28,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3137 states. [2024-10-12 20:22:28,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3137 to 3127. [2024-10-12 20:22:28,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3127 states, 3125 states have (on average 1.39104) internal successors, (4347), 3126 states have internal predecessors, (4347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:28,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 4347 transitions. [2024-10-12 20:22:28,261 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 4347 transitions. Word has length 63 [2024-10-12 20:22:28,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:28,262 INFO L471 AbstractCegarLoop]: Abstraction has 3127 states and 4347 transitions. [2024-10-12 20:22:28,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:28,262 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 4347 transitions. [2024-10-12 20:22:28,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 20:22:28,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:28,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:28,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:22:28,267 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:28,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:28,268 INFO L85 PathProgramCache]: Analyzing trace with hash 143702479, now seen corresponding path program 1 times [2024-10-12 20:22:28,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:28,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210202729] [2024-10-12 20:22:28,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:28,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:28,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:28,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:28,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210202729] [2024-10-12 20:22:28,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210202729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:28,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:28,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:22:28,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062391652] [2024-10-12 20:22:28,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:28,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:22:28,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:28,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:22:28,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:22:28,403 INFO L87 Difference]: Start difference. First operand 3127 states and 4347 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:28,829 INFO L93 Difference]: Finished difference Result 6736 states and 9459 transitions. [2024-10-12 20:22:28,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:22:28,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-12 20:22:28,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:28,846 INFO L225 Difference]: With dead ends: 6736 [2024-10-12 20:22:28,846 INFO L226 Difference]: Without dead ends: 3942 [2024-10-12 20:22:28,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:22:28,853 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 2277 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2277 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:28,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2277 Valid, 519 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:22:28,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3942 states. [2024-10-12 20:22:28,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3942 to 3926. [2024-10-12 20:22:28,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3926 states, 3924 states have (on average 1.3947502548419979) internal successors, (5473), 3925 states have internal predecessors, (5473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3926 states to 3926 states and 5473 transitions. [2024-10-12 20:22:28,990 INFO L78 Accepts]: Start accepts. Automaton has 3926 states and 5473 transitions. Word has length 64 [2024-10-12 20:22:28,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:28,992 INFO L471 AbstractCegarLoop]: Abstraction has 3926 states and 5473 transitions. [2024-10-12 20:22:28,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:28,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3926 states and 5473 transitions. [2024-10-12 20:22:28,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-12 20:22:28,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:28,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:28,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:22:28,998 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:28,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:28,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1303417230, now seen corresponding path program 1 times [2024-10-12 20:22:28,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:28,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435147958] [2024-10-12 20:22:28,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:28,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:29,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:29,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:29,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435147958] [2024-10-12 20:22:29,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435147958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:29,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:29,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:22:29,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712451032] [2024-10-12 20:22:29,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:29,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:22:29,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:29,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:22:29,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:22:29,156 INFO L87 Difference]: Start difference. First operand 3926 states and 5473 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:29,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:29,559 INFO L93 Difference]: Finished difference Result 8986 states and 12600 transitions. [2024-10-12 20:22:29,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:22:29,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-10-12 20:22:29,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:29,576 INFO L225 Difference]: With dead ends: 8986 [2024-10-12 20:22:29,576 INFO L226 Difference]: Without dead ends: 5344 [2024-10-12 20:22:29,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:22:29,581 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 2343 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2343 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:29,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2343 Valid, 527 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:22:29,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2024-10-12 20:22:29,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 3926. [2024-10-12 20:22:29,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3926 states, 3924 states have (on average 1.389908256880734) internal successors, (5454), 3925 states have internal predecessors, (5454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:29,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3926 states to 3926 states and 5454 transitions. [2024-10-12 20:22:29,720 INFO L78 Accepts]: Start accepts. Automaton has 3926 states and 5454 transitions. Word has length 65 [2024-10-12 20:22:29,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:29,720 INFO L471 AbstractCegarLoop]: Abstraction has 3926 states and 5454 transitions. [2024-10-12 20:22:29,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:29,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3926 states and 5454 transitions. [2024-10-12 20:22:29,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-12 20:22:29,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:29,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:29,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:22:29,725 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:29,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:29,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1163054926, now seen corresponding path program 1 times [2024-10-12 20:22:29,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:29,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265815224] [2024-10-12 20:22:29,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:29,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:29,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:29,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:29,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265815224] [2024-10-12 20:22:29,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265815224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:29,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:29,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:22:29,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447291429] [2024-10-12 20:22:29,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:29,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:22:29,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:29,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:22:29,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:22:29,918 INFO L87 Difference]: Start difference. First operand 3926 states and 5454 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:30,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:30,576 INFO L93 Difference]: Finished difference Result 8086 states and 11471 transitions. [2024-10-12 20:22:30,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:22:30,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-10-12 20:22:30,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:30,608 INFO L225 Difference]: With dead ends: 8086 [2024-10-12 20:22:30,608 INFO L226 Difference]: Without dead ends: 6920 [2024-10-12 20:22:30,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:22:30,615 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 3098 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3098 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:30,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3098 Valid, 1014 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:22:30,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6920 states. [2024-10-12 20:22:30,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6920 to 3950. [2024-10-12 20:22:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3950 states, 3948 states have (on average 1.389564336372847) internal successors, (5486), 3949 states have internal predecessors, (5486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:30,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3950 states to 3950 states and 5486 transitions. [2024-10-12 20:22:30,746 INFO L78 Accepts]: Start accepts. Automaton has 3950 states and 5486 transitions. Word has length 65 [2024-10-12 20:22:30,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:30,747 INFO L471 AbstractCegarLoop]: Abstraction has 3950 states and 5486 transitions. [2024-10-12 20:22:30,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:30,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3950 states and 5486 transitions. [2024-10-12 20:22:30,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 20:22:30,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:30,753 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:30,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:22:30,753 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:30,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:30,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1311593556, now seen corresponding path program 1 times [2024-10-12 20:22:30,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:30,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406159633] [2024-10-12 20:22:30,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:30,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:30,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:30,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:30,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406159633] [2024-10-12 20:22:30,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406159633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:30,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:30,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:22:30,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350174105] [2024-10-12 20:22:30,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:30,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:22:30,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:30,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:22:30,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:22:30,945 INFO L87 Difference]: Start difference. First operand 3950 states and 5486 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:31,562 INFO L93 Difference]: Finished difference Result 7375 states and 10349 transitions. [2024-10-12 20:22:31,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:22:31,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-10-12 20:22:31,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:31,588 INFO L225 Difference]: With dead ends: 7375 [2024-10-12 20:22:31,588 INFO L226 Difference]: Without dead ends: 5998 [2024-10-12 20:22:31,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:22:31,594 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 2767 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2767 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:31,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2767 Valid, 929 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:22:31,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2024-10-12 20:22:31,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3978. [2024-10-12 20:22:31,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 3976 states have (on average 1.3888329979879275) internal successors, (5522), 3977 states have internal predecessors, (5522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 5522 transitions. [2024-10-12 20:22:31,689 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 5522 transitions. Word has length 66 [2024-10-12 20:22:31,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:31,690 INFO L471 AbstractCegarLoop]: Abstraction has 3978 states and 5522 transitions. [2024-10-12 20:22:31,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:31,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 5522 transitions. [2024-10-12 20:22:31,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 20:22:31,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:31,694 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:31,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:22:31,695 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:31,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:31,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1448174587, now seen corresponding path program 1 times [2024-10-12 20:22:31,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:31,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870220143] [2024-10-12 20:22:31,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:31,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:31,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:31,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:31,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870220143] [2024-10-12 20:22:31,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870220143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:31,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:31,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:22:31,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388381419] [2024-10-12 20:22:31,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:31,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:22:31,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:31,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:22:31,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:22:31,849 INFO L87 Difference]: Start difference. First operand 3978 states and 5522 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:32,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:32,211 INFO L93 Difference]: Finished difference Result 8836 states and 12281 transitions. [2024-10-12 20:22:32,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:22:32,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-10-12 20:22:32,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:32,222 INFO L225 Difference]: With dead ends: 8836 [2024-10-12 20:22:32,222 INFO L226 Difference]: Without dead ends: 5165 [2024-10-12 20:22:32,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:22:32,230 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 2075 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2075 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:32,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2075 Valid, 475 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:22:32,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2024-10-12 20:22:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 5143. [2024-10-12 20:22:32,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5143 states, 5141 states have (on average 1.3754133437074498) internal successors, (7071), 5142 states have internal predecessors, (7071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:32,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5143 states to 5143 states and 7071 transitions. [2024-10-12 20:22:32,310 INFO L78 Accepts]: Start accepts. Automaton has 5143 states and 7071 transitions. Word has length 66 [2024-10-12 20:22:32,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:32,310 INFO L471 AbstractCegarLoop]: Abstraction has 5143 states and 7071 transitions. [2024-10-12 20:22:32,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:32,311 INFO L276 IsEmpty]: Start isEmpty. Operand 5143 states and 7071 transitions. [2024-10-12 20:22:32,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-12 20:22:32,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:32,316 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:32,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:22:32,317 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:32,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:32,318 INFO L85 PathProgramCache]: Analyzing trace with hash 251496623, now seen corresponding path program 1 times [2024-10-12 20:22:32,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:32,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788269445] [2024-10-12 20:22:32,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:32,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:32,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:32,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:32,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788269445] [2024-10-12 20:22:32,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788269445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:32,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:32,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:22:32,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135795418] [2024-10-12 20:22:32,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:32,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:22:32,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:32,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:22:32,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:22:32,474 INFO L87 Difference]: Start difference. First operand 5143 states and 7071 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:33,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:33,126 INFO L93 Difference]: Finished difference Result 12951 states and 18194 transitions. [2024-10-12 20:22:33,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:22:33,127 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-10-12 20:22:33,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:33,146 INFO L225 Difference]: With dead ends: 12951 [2024-10-12 20:22:33,147 INFO L226 Difference]: Without dead ends: 10751 [2024-10-12 20:22:33,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:22:33,152 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 2900 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2900 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:33,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2900 Valid, 993 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:22:33,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10751 states. [2024-10-12 20:22:33,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10751 to 5240. [2024-10-12 20:22:33,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5240 states, 5238 states have (on average 1.3745704467353952) internal successors, (7200), 5239 states have internal predecessors, (7200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:33,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5240 states to 5240 states and 7200 transitions. [2024-10-12 20:22:33,280 INFO L78 Accepts]: Start accepts. Automaton has 5240 states and 7200 transitions. Word has length 67 [2024-10-12 20:22:33,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:33,280 INFO L471 AbstractCegarLoop]: Abstraction has 5240 states and 7200 transitions. [2024-10-12 20:22:33,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:33,280 INFO L276 IsEmpty]: Start isEmpty. Operand 5240 states and 7200 transitions. [2024-10-12 20:22:33,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-12 20:22:33,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:33,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:33,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:22:33,286 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:33,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:33,286 INFO L85 PathProgramCache]: Analyzing trace with hash 288337870, now seen corresponding path program 1 times [2024-10-12 20:22:33,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:33,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625017446] [2024-10-12 20:22:33,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:33,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:33,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:33,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625017446] [2024-10-12 20:22:33,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625017446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:33,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:33,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:22:33,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876875435] [2024-10-12 20:22:33,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:33,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:22:33,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:33,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:22:33,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:22:33,637 INFO L87 Difference]: Start difference. First operand 5240 states and 7200 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:34,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:34,505 INFO L93 Difference]: Finished difference Result 10788 states and 15112 transitions. [2024-10-12 20:22:34,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:22:34,505 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-10-12 20:22:34,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:34,517 INFO L225 Difference]: With dead ends: 10788 [2024-10-12 20:22:34,517 INFO L226 Difference]: Without dead ends: 7754 [2024-10-12 20:22:34,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:22:34,522 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 1576 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1576 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:34,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1576 Valid, 1628 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:22:34,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7754 states. [2024-10-12 20:22:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7754 to 5236. [2024-10-12 20:22:34,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5236 states, 5234 states have (on average 1.3740924722965226) internal successors, (7192), 5235 states have internal predecessors, (7192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5236 states to 5236 states and 7192 transitions. [2024-10-12 20:22:34,613 INFO L78 Accepts]: Start accepts. Automaton has 5236 states and 7192 transitions. Word has length 68 [2024-10-12 20:22:34,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:34,614 INFO L471 AbstractCegarLoop]: Abstraction has 5236 states and 7192 transitions. [2024-10-12 20:22:34,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:34,614 INFO L276 IsEmpty]: Start isEmpty. Operand 5236 states and 7192 transitions. [2024-10-12 20:22:34,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-12 20:22:34,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:34,619 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:34,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:22:34,619 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:34,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:34,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1656089935, now seen corresponding path program 1 times [2024-10-12 20:22:34,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:34,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492496321] [2024-10-12 20:22:34,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:34,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:34,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:34,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492496321] [2024-10-12 20:22:34,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492496321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:34,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:34,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:22:34,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148475914] [2024-10-12 20:22:34,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:34,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:22:34,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:34,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:22:34,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:22:34,941 INFO L87 Difference]: Start difference. First operand 5236 states and 7192 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:36,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:36,006 INFO L93 Difference]: Finished difference Result 9223 states and 12775 transitions. [2024-10-12 20:22:36,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:22:36,007 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-10-12 20:22:36,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:36,020 INFO L225 Difference]: With dead ends: 9223 [2024-10-12 20:22:36,020 INFO L226 Difference]: Without dead ends: 7605 [2024-10-12 20:22:36,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:22:36,028 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 2144 mSDsluCounter, 1527 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2144 SdHoareTripleChecker+Valid, 1894 SdHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:36,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2144 Valid, 1894 Invalid, 1529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 20:22:36,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7605 states. [2024-10-12 20:22:36,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7605 to 5236. [2024-10-12 20:22:36,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5236 states, 5234 states have (on average 1.3737103553687429) internal successors, (7190), 5235 states have internal predecessors, (7190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:36,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5236 states to 5236 states and 7190 transitions. [2024-10-12 20:22:36,127 INFO L78 Accepts]: Start accepts. Automaton has 5236 states and 7190 transitions. Word has length 68 [2024-10-12 20:22:36,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:36,127 INFO L471 AbstractCegarLoop]: Abstraction has 5236 states and 7190 transitions. [2024-10-12 20:22:36,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:36,128 INFO L276 IsEmpty]: Start isEmpty. Operand 5236 states and 7190 transitions. [2024-10-12 20:22:36,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 20:22:36,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:36,134 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:36,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:22:36,134 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:36,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:36,134 INFO L85 PathProgramCache]: Analyzing trace with hash -583929423, now seen corresponding path program 1 times [2024-10-12 20:22:36,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:36,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304890599] [2024-10-12 20:22:36,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:36,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:36,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:36,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:36,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304890599] [2024-10-12 20:22:36,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304890599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:36,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:36,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:22:36,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164423853] [2024-10-12 20:22:36,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:36,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:22:36,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:36,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:22:36,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:22:36,431 INFO L87 Difference]: Start difference. First operand 5236 states and 7190 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:37,080 INFO L93 Difference]: Finished difference Result 10890 states and 15263 transitions. [2024-10-12 20:22:37,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:22:37,081 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-10-12 20:22:37,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:37,094 INFO L225 Difference]: With dead ends: 10890 [2024-10-12 20:22:37,094 INFO L226 Difference]: Without dead ends: 7814 [2024-10-12 20:22:37,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:22:37,100 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 2428 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2428 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:37,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2428 Valid, 1565 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:22:37,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7814 states. [2024-10-12 20:22:37,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7814 to 5212. [2024-10-12 20:22:37,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5212 states, 5210 states have (on average 1.372552783109405) internal successors, (7151), 5211 states have internal predecessors, (7151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:37,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5212 states to 5212 states and 7151 transitions. [2024-10-12 20:22:37,195 INFO L78 Accepts]: Start accepts. Automaton has 5212 states and 7151 transitions. Word has length 69 [2024-10-12 20:22:37,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:37,196 INFO L471 AbstractCegarLoop]: Abstraction has 5212 states and 7151 transitions. [2024-10-12 20:22:37,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:37,196 INFO L276 IsEmpty]: Start isEmpty. Operand 5212 states and 7151 transitions. [2024-10-12 20:22:37,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 20:22:37,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:37,202 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:37,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:22:37,203 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:37,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:37,203 INFO L85 PathProgramCache]: Analyzing trace with hash -843555950, now seen corresponding path program 1 times [2024-10-12 20:22:37,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:37,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738479921] [2024-10-12 20:22:37,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:37,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:37,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:37,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738479921] [2024-10-12 20:22:37,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738479921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:37,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:37,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 20:22:37,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532400772] [2024-10-12 20:22:37,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:37,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:22:37,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:37,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:22:37,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:22:37,951 INFO L87 Difference]: Start difference. First operand 5212 states and 7151 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:38,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:38,656 INFO L93 Difference]: Finished difference Result 11742 states and 16524 transitions. [2024-10-12 20:22:38,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:22:38,656 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-10-12 20:22:38,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:38,670 INFO L225 Difference]: With dead ends: 11742 [2024-10-12 20:22:38,670 INFO L226 Difference]: Without dead ends: 8690 [2024-10-12 20:22:38,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-10-12 20:22:38,679 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 3633 mSDsluCounter, 2422 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3633 SdHoareTripleChecker+Valid, 2981 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:38,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3633 Valid, 2981 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:22:38,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8690 states. [2024-10-12 20:22:38,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8690 to 5186. [2024-10-12 20:22:38,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 5184 states have (on average 1.3724922839506173) internal successors, (7115), 5185 states have internal predecessors, (7115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:38,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7115 transitions. [2024-10-12 20:22:38,761 INFO L78 Accepts]: Start accepts. Automaton has 5186 states and 7115 transitions. Word has length 69 [2024-10-12 20:22:38,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:38,762 INFO L471 AbstractCegarLoop]: Abstraction has 5186 states and 7115 transitions. [2024-10-12 20:22:38,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:38,762 INFO L276 IsEmpty]: Start isEmpty. Operand 5186 states and 7115 transitions. [2024-10-12 20:22:38,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 20:22:38,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:38,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:38,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:22:38,769 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:38,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash -48339803, now seen corresponding path program 1 times [2024-10-12 20:22:38,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:38,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364516106] [2024-10-12 20:22:38,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:38,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:38,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:38,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:38,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364516106] [2024-10-12 20:22:38,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364516106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:38,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:38,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:22:38,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238396843] [2024-10-12 20:22:38,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:38,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:22:38,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:38,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:22:38,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:22:38,909 INFO L87 Difference]: Start difference. First operand 5186 states and 7115 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:39,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:39,532 INFO L93 Difference]: Finished difference Result 11686 states and 16348 transitions. [2024-10-12 20:22:39,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:22:39,533 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-10-12 20:22:39,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:39,548 INFO L225 Difference]: With dead ends: 11686 [2024-10-12 20:22:39,548 INFO L226 Difference]: Without dead ends: 9650 [2024-10-12 20:22:39,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:22:39,554 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 2768 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2768 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:39,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2768 Valid, 964 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:22:39,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9650 states. [2024-10-12 20:22:39,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9650 to 5257. [2024-10-12 20:22:39,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5257 states, 5255 states have (on average 1.3727878211227402) internal successors, (7214), 5256 states have internal predecessors, (7214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:39,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5257 states to 5257 states and 7214 transitions. [2024-10-12 20:22:39,655 INFO L78 Accepts]: Start accepts. Automaton has 5257 states and 7214 transitions. Word has length 69 [2024-10-12 20:22:39,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:39,656 INFO L471 AbstractCegarLoop]: Abstraction has 5257 states and 7214 transitions. [2024-10-12 20:22:39,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:39,656 INFO L276 IsEmpty]: Start isEmpty. Operand 5257 states and 7214 transitions. [2024-10-12 20:22:39,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 20:22:39,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:39,661 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:39,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:22:39,662 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:39,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:39,662 INFO L85 PathProgramCache]: Analyzing trace with hash 764464694, now seen corresponding path program 1 times [2024-10-12 20:22:39,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:39,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218855848] [2024-10-12 20:22:39,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:39,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:40,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:40,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:40,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218855848] [2024-10-12 20:22:40,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218855848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:40,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:40,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:22:40,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283669322] [2024-10-12 20:22:40,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:40,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:22:40,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:40,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:22:40,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:22:40,301 INFO L87 Difference]: Start difference. First operand 5257 states and 7214 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:40,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:40,865 INFO L93 Difference]: Finished difference Result 10780 states and 15154 transitions. [2024-10-12 20:22:40,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:22:40,866 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-10-12 20:22:40,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:40,874 INFO L225 Difference]: With dead ends: 10780 [2024-10-12 20:22:40,874 INFO L226 Difference]: Without dead ends: 7622 [2024-10-12 20:22:40,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:22:40,878 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 3019 mSDsluCounter, 1972 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3019 SdHoareTripleChecker+Valid, 2520 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:40,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3019 Valid, 2520 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:22:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7622 states. [2024-10-12 20:22:40,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7622 to 5117. [2024-10-12 20:22:40,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5117 states, 5115 states have (on average 1.3747800586510264) internal successors, (7032), 5116 states have internal predecessors, (7032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:40,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5117 states to 5117 states and 7032 transitions. [2024-10-12 20:22:40,942 INFO L78 Accepts]: Start accepts. Automaton has 5117 states and 7032 transitions. Word has length 69 [2024-10-12 20:22:40,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:40,942 INFO L471 AbstractCegarLoop]: Abstraction has 5117 states and 7032 transitions. [2024-10-12 20:22:40,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:40,942 INFO L276 IsEmpty]: Start isEmpty. Operand 5117 states and 7032 transitions. [2024-10-12 20:22:40,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-12 20:22:40,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:40,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:40,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:22:40,951 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:40,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:40,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1937241439, now seen corresponding path program 1 times [2024-10-12 20:22:40,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:40,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427928073] [2024-10-12 20:22:40,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:40,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:41,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:41,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:41,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427928073] [2024-10-12 20:22:41,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427928073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:41,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:41,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-12 20:22:41,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545646003] [2024-10-12 20:22:41,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:41,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 20:22:41,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:41,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 20:22:41,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-10-12 20:22:41,684 INFO L87 Difference]: Start difference. First operand 5117 states and 7032 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:42,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:42,759 INFO L93 Difference]: Finished difference Result 18517 states and 26199 transitions. [2024-10-12 20:22:42,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 20:22:42,760 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-10-12 20:22:42,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:42,780 INFO L225 Difference]: With dead ends: 18517 [2024-10-12 20:22:42,781 INFO L226 Difference]: Without dead ends: 15406 [2024-10-12 20:22:42,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2024-10-12 20:22:42,791 INFO L432 NwaCegarLoop]: 495 mSDtfsCounter, 4508 mSDsluCounter, 2757 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4508 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:42,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4508 Valid, 3252 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:22:42,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15406 states. [2024-10-12 20:22:42,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15406 to 5032. [2024-10-12 20:22:42,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5032 states, 5031 states have (on average 1.372291790896442) internal successors, (6904), 5031 states have internal predecessors, (6904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5032 states to 5032 states and 6904 transitions. [2024-10-12 20:22:42,914 INFO L78 Accepts]: Start accepts. Automaton has 5032 states and 6904 transitions. Word has length 70 [2024-10-12 20:22:42,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:42,915 INFO L471 AbstractCegarLoop]: Abstraction has 5032 states and 6904 transitions. [2024-10-12 20:22:42,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 5032 states and 6904 transitions. [2024-10-12 20:22:42,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-12 20:22:42,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:42,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:42,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:22:42,921 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:42,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:42,921 INFO L85 PathProgramCache]: Analyzing trace with hash 827160211, now seen corresponding path program 1 times [2024-10-12 20:22:42,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:42,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714754261] [2024-10-12 20:22:42,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:42,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:43,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:43,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714754261] [2024-10-12 20:22:43,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714754261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:43,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:43,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:22:43,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464143782] [2024-10-12 20:22:43,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:43,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:22:43,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:43,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:22:43,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:22:43,067 INFO L87 Difference]: Start difference. First operand 5032 states and 6904 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:43,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:43,542 INFO L93 Difference]: Finished difference Result 11451 states and 16029 transitions. [2024-10-12 20:22:43,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:22:43,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-10-12 20:22:43,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:43,551 INFO L225 Difference]: With dead ends: 11451 [2024-10-12 20:22:43,551 INFO L226 Difference]: Without dead ends: 9427 [2024-10-12 20:22:43,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:22:43,554 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 2505 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2505 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:43,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2505 Valid, 884 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:22:43,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9427 states. [2024-10-12 20:22:43,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9427 to 5075. [2024-10-12 20:22:43,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5075 states, 5074 states have (on average 1.3726842727631061) internal successors, (6965), 5074 states have internal predecessors, (6965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:43,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5075 states to 5075 states and 6965 transitions. [2024-10-12 20:22:43,642 INFO L78 Accepts]: Start accepts. Automaton has 5075 states and 6965 transitions. Word has length 70 [2024-10-12 20:22:43,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:43,643 INFO L471 AbstractCegarLoop]: Abstraction has 5075 states and 6965 transitions. [2024-10-12 20:22:43,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:43,643 INFO L276 IsEmpty]: Start isEmpty. Operand 5075 states and 6965 transitions. [2024-10-12 20:22:43,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-12 20:22:43,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:43,647 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:43,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:22:43,648 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:43,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:43,648 INFO L85 PathProgramCache]: Analyzing trace with hash -615241948, now seen corresponding path program 1 times [2024-10-12 20:22:43,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:43,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835123682] [2024-10-12 20:22:43,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:43,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:43,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:43,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:43,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835123682] [2024-10-12 20:22:43,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835123682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:43,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:43,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:22:43,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966818660] [2024-10-12 20:22:43,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:43,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:22:43,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:43,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:22:43,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:22:43,832 INFO L87 Difference]: Start difference. First operand 5075 states and 6965 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:44,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:44,366 INFO L93 Difference]: Finished difference Result 12694 states and 17850 transitions. [2024-10-12 20:22:44,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:22:44,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-10-12 20:22:44,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:44,380 INFO L225 Difference]: With dead ends: 12694 [2024-10-12 20:22:44,381 INFO L226 Difference]: Without dead ends: 10612 [2024-10-12 20:22:44,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:22:44,388 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 2591 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2591 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:44,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2591 Valid, 891 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:22:44,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10612 states. [2024-10-12 20:22:44,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10612 to 5105. [2024-10-12 20:22:44,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5105 states, 5104 states have (on average 1.3724529780564263) internal successors, (7005), 5104 states have internal predecessors, (7005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5105 states to 5105 states and 7005 transitions. [2024-10-12 20:22:44,527 INFO L78 Accepts]: Start accepts. Automaton has 5105 states and 7005 transitions. Word has length 70 [2024-10-12 20:22:44,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:44,527 INFO L471 AbstractCegarLoop]: Abstraction has 5105 states and 7005 transitions. [2024-10-12 20:22:44,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:44,528 INFO L276 IsEmpty]: Start isEmpty. Operand 5105 states and 7005 transitions. [2024-10-12 20:22:44,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-12 20:22:44,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:44,533 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:44,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:22:44,534 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:44,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:44,535 INFO L85 PathProgramCache]: Analyzing trace with hash 2007440010, now seen corresponding path program 1 times [2024-10-12 20:22:44,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:44,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127584080] [2024-10-12 20:22:44,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:44,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:44,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:44,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:44,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127584080] [2024-10-12 20:22:44,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127584080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:44,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:44,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:22:44,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116061885] [2024-10-12 20:22:44,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:44,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:22:44,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:44,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:22:44,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:22:44,880 INFO L87 Difference]: Start difference. First operand 5105 states and 7005 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:45,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:45,644 INFO L93 Difference]: Finished difference Result 12172 states and 17065 transitions. [2024-10-12 20:22:45,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:22:45,645 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-10-12 20:22:45,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:45,651 INFO L225 Difference]: With dead ends: 12172 [2024-10-12 20:22:45,651 INFO L226 Difference]: Without dead ends: 8884 [2024-10-12 20:22:45,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2024-10-12 20:22:45,655 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 2160 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:45,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2160 Valid, 1674 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:22:45,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8884 states. [2024-10-12 20:22:45,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8884 to 4968. [2024-10-12 20:22:45,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4968 states, 4967 states have (on average 1.3724582242802497) internal successors, (6817), 4967 states have internal predecessors, (6817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:45,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4968 states to 4968 states and 6817 transitions. [2024-10-12 20:22:45,704 INFO L78 Accepts]: Start accepts. Automaton has 4968 states and 6817 transitions. Word has length 70 [2024-10-12 20:22:45,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:45,704 INFO L471 AbstractCegarLoop]: Abstraction has 4968 states and 6817 transitions. [2024-10-12 20:22:45,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:45,704 INFO L276 IsEmpty]: Start isEmpty. Operand 4968 states and 6817 transitions. [2024-10-12 20:22:45,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-12 20:22:45,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:45,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:45,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:22:45,709 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:45,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:45,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1762987459, now seen corresponding path program 1 times [2024-10-12 20:22:45,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:45,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66903001] [2024-10-12 20:22:45,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:45,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:46,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:46,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66903001] [2024-10-12 20:22:46,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66903001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:46,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:46,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:22:46,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278054658] [2024-10-12 20:22:46,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:46,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:22:46,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:46,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:22:46,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:22:46,085 INFO L87 Difference]: Start difference. First operand 4968 states and 6817 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:47,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:47,084 INFO L93 Difference]: Finished difference Result 10472 states and 14669 transitions. [2024-10-12 20:22:47,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:22:47,085 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-10-12 20:22:47,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:47,091 INFO L225 Difference]: With dead ends: 10472 [2024-10-12 20:22:47,091 INFO L226 Difference]: Without dead ends: 7268 [2024-10-12 20:22:47,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-12 20:22:47,095 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 1907 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1907 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:47,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1907 Valid, 1622 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1305 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:22:47,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7268 states. [2024-10-12 20:22:47,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7268 to 4968. [2024-10-12 20:22:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4968 states, 4967 states have (on average 1.3720555667404872) internal successors, (6815), 4967 states have internal predecessors, (6815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:47,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4968 states to 4968 states and 6815 transitions. [2024-10-12 20:22:47,150 INFO L78 Accepts]: Start accepts. Automaton has 4968 states and 6815 transitions. Word has length 71 [2024-10-12 20:22:47,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:47,150 INFO L471 AbstractCegarLoop]: Abstraction has 4968 states and 6815 transitions. [2024-10-12 20:22:47,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:47,151 INFO L276 IsEmpty]: Start isEmpty. Operand 4968 states and 6815 transitions. [2024-10-12 20:22:47,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-12 20:22:47,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:47,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:47,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 20:22:47,155 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:47,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:47,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1894019455, now seen corresponding path program 1 times [2024-10-12 20:22:47,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:47,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849471253] [2024-10-12 20:22:47,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:47,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:47,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:47,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:47,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849471253] [2024-10-12 20:22:47,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849471253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:47,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:47,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:22:47,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435688143] [2024-10-12 20:22:47,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:47,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:22:47,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:47,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:22:47,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:22:47,640 INFO L87 Difference]: Start difference. First operand 4968 states and 6815 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:48,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:48,337 INFO L93 Difference]: Finished difference Result 11364 states and 16004 transitions. [2024-10-12 20:22:48,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:22:48,338 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-10-12 20:22:48,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:48,344 INFO L225 Difference]: With dead ends: 11364 [2024-10-12 20:22:48,344 INFO L226 Difference]: Without dead ends: 8334 [2024-10-12 20:22:48,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2024-10-12 20:22:48,348 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 3194 mSDsluCounter, 2010 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3194 SdHoareTripleChecker+Valid, 2511 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:48,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3194 Valid, 2511 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:22:48,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8334 states. [2024-10-12 20:22:48,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8334 to 4976. [2024-10-12 20:22:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4976 states, 4975 states have (on average 1.3722613065326634) internal successors, (6827), 4975 states have internal predecessors, (6827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4976 states to 4976 states and 6827 transitions. [2024-10-12 20:22:48,396 INFO L78 Accepts]: Start accepts. Automaton has 4976 states and 6827 transitions. Word has length 71 [2024-10-12 20:22:48,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:48,396 INFO L471 AbstractCegarLoop]: Abstraction has 4976 states and 6827 transitions. [2024-10-12 20:22:48,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 4976 states and 6827 transitions. [2024-10-12 20:22:48,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:22:48,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:48,399 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:48,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 20:22:48,399 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:48,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:48,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1391207358, now seen corresponding path program 1 times [2024-10-12 20:22:48,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:48,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372445605] [2024-10-12 20:22:48,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:48,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:48,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:48,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:48,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372445605] [2024-10-12 20:22:48,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372445605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:48,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:48,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:22:48,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191266652] [2024-10-12 20:22:48,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:48,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:22:48,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:48,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:22:48,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:48,477 INFO L87 Difference]: Start difference. First operand 4976 states and 6827 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:48,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:48,518 INFO L93 Difference]: Finished difference Result 6759 states and 9312 transitions. [2024-10-12 20:22:48,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:22:48,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-10-12 20:22:48,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:48,524 INFO L225 Difference]: With dead ends: 6759 [2024-10-12 20:22:48,524 INFO L226 Difference]: Without dead ends: 4843 [2024-10-12 20:22:48,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:48,527 INFO L432 NwaCegarLoop]: 686 mSDtfsCounter, 357 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:48,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 999 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:22:48,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4843 states. [2024-10-12 20:22:48,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4843 to 4841. [2024-10-12 20:22:48,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4841 states, 4840 states have (on average 1.3580578512396695) internal successors, (6573), 4840 states have internal predecessors, (6573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:48,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4841 states to 4841 states and 6573 transitions. [2024-10-12 20:22:48,586 INFO L78 Accepts]: Start accepts. Automaton has 4841 states and 6573 transitions. Word has length 72 [2024-10-12 20:22:48,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:48,587 INFO L471 AbstractCegarLoop]: Abstraction has 4841 states and 6573 transitions. [2024-10-12 20:22:48,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:48,587 INFO L276 IsEmpty]: Start isEmpty. Operand 4841 states and 6573 transitions. [2024-10-12 20:22:48,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:22:48,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:48,592 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:48,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 20:22:48,593 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:48,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:48,593 INFO L85 PathProgramCache]: Analyzing trace with hash 590821425, now seen corresponding path program 1 times [2024-10-12 20:22:48,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:48,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661530327] [2024-10-12 20:22:48,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:48,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:48,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:48,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:48,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661530327] [2024-10-12 20:22:48,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661530327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:48,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:48,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:22:48,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605371365] [2024-10-12 20:22:48,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:48,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:22:48,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:48,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:22:48,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:48,659 INFO L87 Difference]: Start difference. First operand 4841 states and 6573 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:48,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:48,703 INFO L93 Difference]: Finished difference Result 7172 states and 9837 transitions. [2024-10-12 20:22:48,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:22:48,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-10-12 20:22:48,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:48,709 INFO L225 Difference]: With dead ends: 7172 [2024-10-12 20:22:48,709 INFO L226 Difference]: Without dead ends: 4843 [2024-10-12 20:22:48,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:48,713 INFO L432 NwaCegarLoop]: 726 mSDtfsCounter, 340 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:48,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1218 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:22:48,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4843 states. [2024-10-12 20:22:48,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4843 to 4841. [2024-10-12 20:22:48,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4841 states, 4840 states have (on average 1.3477272727272727) internal successors, (6523), 4840 states have internal predecessors, (6523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:48,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4841 states to 4841 states and 6523 transitions. [2024-10-12 20:22:48,769 INFO L78 Accepts]: Start accepts. Automaton has 4841 states and 6523 transitions. Word has length 72 [2024-10-12 20:22:48,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:48,769 INFO L471 AbstractCegarLoop]: Abstraction has 4841 states and 6523 transitions. [2024-10-12 20:22:48,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:48,770 INFO L276 IsEmpty]: Start isEmpty. Operand 4841 states and 6523 transitions. [2024-10-12 20:22:48,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-12 20:22:48,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:48,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:48,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 20:22:48,775 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:48,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:48,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1104340922, now seen corresponding path program 1 times [2024-10-12 20:22:48,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:48,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082008799] [2024-10-12 20:22:48,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:48,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:48,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:48,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:48,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082008799] [2024-10-12 20:22:48,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082008799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:48,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:48,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:22:48,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129186792] [2024-10-12 20:22:48,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:48,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:22:48,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:48,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:22:48,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:48,834 INFO L87 Difference]: Start difference. First operand 4841 states and 6523 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:48,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:48,921 INFO L93 Difference]: Finished difference Result 9627 states and 13131 transitions. [2024-10-12 20:22:48,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:22:48,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-10-12 20:22:48,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:48,957 INFO L225 Difference]: With dead ends: 9627 [2024-10-12 20:22:48,958 INFO L226 Difference]: Without dead ends: 6835 [2024-10-12 20:22:48,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:48,962 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 410 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:48,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 602 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:22:48,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6835 states. [2024-10-12 20:22:49,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6835 to 6815. [2024-10-12 20:22:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6815 states, 6814 states have (on average 1.367331963604344) internal successors, (9317), 6814 states have internal predecessors, (9317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:49,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6815 states to 6815 states and 9317 transitions. [2024-10-12 20:22:49,036 INFO L78 Accepts]: Start accepts. Automaton has 6815 states and 9317 transitions. Word has length 73 [2024-10-12 20:22:49,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:49,036 INFO L471 AbstractCegarLoop]: Abstraction has 6815 states and 9317 transitions. [2024-10-12 20:22:49,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:49,036 INFO L276 IsEmpty]: Start isEmpty. Operand 6815 states and 9317 transitions. [2024-10-12 20:22:49,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-12 20:22:49,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:49,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:49,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 20:22:49,041 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:49,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:49,042 INFO L85 PathProgramCache]: Analyzing trace with hash 79843687, now seen corresponding path program 1 times [2024-10-12 20:22:49,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:49,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557177439] [2024-10-12 20:22:49,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:49,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:49,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:49,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:49,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557177439] [2024-10-12 20:22:49,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557177439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:49,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:49,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:22:49,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201392859] [2024-10-12 20:22:49,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:49,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:22:49,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:49,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:22:49,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:49,093 INFO L87 Difference]: Start difference. First operand 6815 states and 9317 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:49,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:49,164 INFO L93 Difference]: Finished difference Result 12468 states and 17209 transitions. [2024-10-12 20:22:49,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:22:49,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-10-12 20:22:49,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:49,173 INFO L225 Difference]: With dead ends: 12468 [2024-10-12 20:22:49,173 INFO L226 Difference]: Without dead ends: 8330 [2024-10-12 20:22:49,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:49,179 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 411 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:49,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 661 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:22:49,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8330 states. [2024-10-12 20:22:49,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8330 to 6340. [2024-10-12 20:22:49,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6340 states, 6339 states have (on average 1.3721407162012935) internal successors, (8698), 6339 states have internal predecessors, (8698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:49,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6340 states to 6340 states and 8698 transitions. [2024-10-12 20:22:49,256 INFO L78 Accepts]: Start accepts. Automaton has 6340 states and 8698 transitions. Word has length 73 [2024-10-12 20:22:49,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:49,256 INFO L471 AbstractCegarLoop]: Abstraction has 6340 states and 8698 transitions. [2024-10-12 20:22:49,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:49,257 INFO L276 IsEmpty]: Start isEmpty. Operand 6340 states and 8698 transitions. [2024-10-12 20:22:49,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:22:49,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:49,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:49,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 20:22:49,261 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:49,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:49,261 INFO L85 PathProgramCache]: Analyzing trace with hash 622741446, now seen corresponding path program 1 times [2024-10-12 20:22:49,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:49,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069570967] [2024-10-12 20:22:49,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:49,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:49,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:49,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:49,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069570967] [2024-10-12 20:22:49,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069570967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:49,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:49,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:22:49,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508110168] [2024-10-12 20:22:49,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:49,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:22:49,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:49,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:22:49,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:22:49,551 INFO L87 Difference]: Start difference. First operand 6340 states and 8698 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:50,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:50,156 INFO L93 Difference]: Finished difference Result 10870 states and 15011 transitions. [2024-10-12 20:22:50,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:22:50,156 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-12 20:22:50,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:50,165 INFO L225 Difference]: With dead ends: 10870 [2024-10-12 20:22:50,165 INFO L226 Difference]: Without dead ends: 9933 [2024-10-12 20:22:50,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:22:50,169 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 1418 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1418 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:50,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1418 Valid, 1538 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:22:50,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9933 states. [2024-10-12 20:22:50,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9933 to 6317. [2024-10-12 20:22:50,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6317 states, 6316 states have (on average 1.3723875870804307) internal successors, (8668), 6316 states have internal predecessors, (8668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6317 states to 6317 states and 8668 transitions. [2024-10-12 20:22:50,262 INFO L78 Accepts]: Start accepts. Automaton has 6317 states and 8668 transitions. Word has length 74 [2024-10-12 20:22:50,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:50,263 INFO L471 AbstractCegarLoop]: Abstraction has 6317 states and 8668 transitions. [2024-10-12 20:22:50,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 6317 states and 8668 transitions. [2024-10-12 20:22:50,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:22:50,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:50,266 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:50,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-12 20:22:50,266 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:50,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:50,266 INFO L85 PathProgramCache]: Analyzing trace with hash -535922221, now seen corresponding path program 1 times [2024-10-12 20:22:50,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:50,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446401041] [2024-10-12 20:22:50,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:50,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:50,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:50,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:50,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446401041] [2024-10-12 20:22:50,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446401041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:50,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:50,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:22:50,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933736145] [2024-10-12 20:22:50,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:50,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:22:50,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:50,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:22:50,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:22:50,523 INFO L87 Difference]: Start difference. First operand 6317 states and 8668 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:51,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:51,065 INFO L93 Difference]: Finished difference Result 7349 states and 10078 transitions. [2024-10-12 20:22:51,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:22:51,066 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-12 20:22:51,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:51,071 INFO L225 Difference]: With dead ends: 7349 [2024-10-12 20:22:51,071 INFO L226 Difference]: Without dead ends: 6455 [2024-10-12 20:22:51,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:22:51,073 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 1729 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1729 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:51,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1729 Valid, 1250 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:22:51,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6455 states. [2024-10-12 20:22:51,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6455 to 6315. [2024-10-12 20:22:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6315 states, 6314 states have (on average 1.3721887868229332) internal successors, (8664), 6314 states have internal predecessors, (8664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:51,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6315 states to 6315 states and 8664 transitions. [2024-10-12 20:22:51,146 INFO L78 Accepts]: Start accepts. Automaton has 6315 states and 8664 transitions. Word has length 74 [2024-10-12 20:22:51,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:51,147 INFO L471 AbstractCegarLoop]: Abstraction has 6315 states and 8664 transitions. [2024-10-12 20:22:51,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:51,147 INFO L276 IsEmpty]: Start isEmpty. Operand 6315 states and 8664 transitions. [2024-10-12 20:22:51,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 20:22:51,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:51,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:51,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-12 20:22:51,151 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:51,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:51,152 INFO L85 PathProgramCache]: Analyzing trace with hash 353323446, now seen corresponding path program 1 times [2024-10-12 20:22:51,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:51,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361739930] [2024-10-12 20:22:51,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:51,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:51,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:51,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:51,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361739930] [2024-10-12 20:22:51,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361739930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:51,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:51,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:22:51,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047178452] [2024-10-12 20:22:51,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:51,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:22:51,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:51,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:22:51,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:51,214 INFO L87 Difference]: Start difference. First operand 6315 states and 8664 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:51,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:51,257 INFO L93 Difference]: Finished difference Result 8406 states and 11554 transitions. [2024-10-12 20:22:51,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:22:51,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-10-12 20:22:51,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:51,262 INFO L225 Difference]: With dead ends: 8406 [2024-10-12 20:22:51,262 INFO L226 Difference]: Without dead ends: 5334 [2024-10-12 20:22:51,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:51,265 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 280 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:51,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 939 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:22:51,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5334 states. [2024-10-12 20:22:51,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5334 to 4223. [2024-10-12 20:22:51,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4223 states, 4222 states have (on average 1.3379914732354334) internal successors, (5649), 4222 states have internal predecessors, (5649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4223 states to 4223 states and 5649 transitions. [2024-10-12 20:22:51,314 INFO L78 Accepts]: Start accepts. Automaton has 4223 states and 5649 transitions. Word has length 75 [2024-10-12 20:22:51,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:51,315 INFO L471 AbstractCegarLoop]: Abstraction has 4223 states and 5649 transitions. [2024-10-12 20:22:51,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:51,315 INFO L276 IsEmpty]: Start isEmpty. Operand 4223 states and 5649 transitions. [2024-10-12 20:22:51,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 20:22:51,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:51,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:51,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-12 20:22:51,319 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:51,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:51,320 INFO L85 PathProgramCache]: Analyzing trace with hash -621614464, now seen corresponding path program 1 times [2024-10-12 20:22:51,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:51,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089765727] [2024-10-12 20:22:51,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:51,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:51,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:51,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089765727] [2024-10-12 20:22:51,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089765727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:51,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:51,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:22:51,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944594107] [2024-10-12 20:22:51,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:51,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:22:51,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:51,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:22:51,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:51,384 INFO L87 Difference]: Start difference. First operand 4223 states and 5649 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:51,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:51,472 INFO L93 Difference]: Finished difference Result 6235 states and 8415 transitions. [2024-10-12 20:22:51,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:22:51,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-10-12 20:22:51,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:51,477 INFO L225 Difference]: With dead ends: 6235 [2024-10-12 20:22:51,477 INFO L226 Difference]: Without dead ends: 4225 [2024-10-12 20:22:51,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:51,481 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 254 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:51,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 965 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:22:51,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4225 states. [2024-10-12 20:22:51,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4225 to 4223. [2024-10-12 20:22:51,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4223 states, 4222 states have (on average 1.3230696352439602) internal successors, (5586), 4222 states have internal predecessors, (5586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:51,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4223 states to 4223 states and 5586 transitions. [2024-10-12 20:22:51,544 INFO L78 Accepts]: Start accepts. Automaton has 4223 states and 5586 transitions. Word has length 75 [2024-10-12 20:22:51,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:51,545 INFO L471 AbstractCegarLoop]: Abstraction has 4223 states and 5586 transitions. [2024-10-12 20:22:51,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:51,546 INFO L276 IsEmpty]: Start isEmpty. Operand 4223 states and 5586 transitions. [2024-10-12 20:22:51,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 20:22:51,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:51,551 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:51,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-12 20:22:51,552 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:51,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:51,552 INFO L85 PathProgramCache]: Analyzing trace with hash 706693622, now seen corresponding path program 1 times [2024-10-12 20:22:51,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:51,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124091086] [2024-10-12 20:22:51,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:51,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:51,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:51,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124091086] [2024-10-12 20:22:51,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124091086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:51,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:51,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:22:51,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771635533] [2024-10-12 20:22:51,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:51,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:22:51,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:51,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:22:51,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:51,621 INFO L87 Difference]: Start difference. First operand 4223 states and 5586 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:51,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:51,719 INFO L93 Difference]: Finished difference Result 7544 states and 10081 transitions. [2024-10-12 20:22:51,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:22:51,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-12 20:22:51,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:51,726 INFO L225 Difference]: With dead ends: 7544 [2024-10-12 20:22:51,726 INFO L226 Difference]: Without dead ends: 5056 [2024-10-12 20:22:51,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:22:51,730 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 364 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:51,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 516 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:22:51,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5056 states. [2024-10-12 20:22:51,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5056 to 3950. [2024-10-12 20:22:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3950 states, 3949 states have (on average 1.327677893137503) internal successors, (5243), 3949 states have internal predecessors, (5243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:51,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3950 states to 3950 states and 5243 transitions. [2024-10-12 20:22:51,790 INFO L78 Accepts]: Start accepts. Automaton has 3950 states and 5243 transitions. Word has length 76 [2024-10-12 20:22:51,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:51,790 INFO L471 AbstractCegarLoop]: Abstraction has 3950 states and 5243 transitions. [2024-10-12 20:22:51,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:51,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3950 states and 5243 transitions. [2024-10-12 20:22:51,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:22:51,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:51,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:51,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-12 20:22:51,795 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:51,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:51,796 INFO L85 PathProgramCache]: Analyzing trace with hash 353989717, now seen corresponding path program 1 times [2024-10-12 20:22:51,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:51,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475879187] [2024-10-12 20:22:51,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:51,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:52,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:52,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:52,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475879187] [2024-10-12 20:22:52,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475879187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:52,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:52,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-12 20:22:52,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314544725] [2024-10-12 20:22:52,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:52,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 20:22:52,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:52,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 20:22:52,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-10-12 20:22:52,392 INFO L87 Difference]: Start difference. First operand 3950 states and 5243 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:53,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:53,215 INFO L93 Difference]: Finished difference Result 12526 states and 16990 transitions. [2024-10-12 20:22:53,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 20:22:53,216 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-12 20:22:53,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:53,252 INFO L225 Difference]: With dead ends: 12526 [2024-10-12 20:22:53,252 INFO L226 Difference]: Without dead ends: 11943 [2024-10-12 20:22:53,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=576, Unknown=0, NotChecked=0, Total=756 [2024-10-12 20:22:53,254 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 2792 mSDsluCounter, 2665 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2792 SdHoareTripleChecker+Valid, 3063 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:53,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2792 Valid, 3063 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:22:53,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11943 states. [2024-10-12 20:22:53,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11943 to 3885. [2024-10-12 20:22:53,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3885 states, 3884 states have (on average 1.3300720906282184) internal successors, (5166), 3884 states have internal predecessors, (5166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:53,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3885 states to 3885 states and 5166 transitions. [2024-10-12 20:22:53,302 INFO L78 Accepts]: Start accepts. Automaton has 3885 states and 5166 transitions. Word has length 77 [2024-10-12 20:22:53,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:53,302 INFO L471 AbstractCegarLoop]: Abstraction has 3885 states and 5166 transitions. [2024-10-12 20:22:53,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:53,303 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 5166 transitions. [2024-10-12 20:22:53,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:22:53,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:53,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:53,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-12 20:22:53,305 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:53,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:53,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1552828077, now seen corresponding path program 1 times [2024-10-12 20:22:53,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:53,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560462858] [2024-10-12 20:22:53,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:53,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:55,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:55,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:55,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560462858] [2024-10-12 20:22:55,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560462858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:55,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:55,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-10-12 20:22:55,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044845524] [2024-10-12 20:22:55,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:55,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-12 20:22:55,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:55,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-12 20:22:55,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2024-10-12 20:22:55,048 INFO L87 Difference]: Start difference. First operand 3885 states and 5166 transitions. Second operand has 27 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:57,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:57,972 INFO L93 Difference]: Finished difference Result 10879 states and 14676 transitions. [2024-10-12 20:22:57,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-12 20:22:57,972 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-12 20:22:57,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:57,981 INFO L225 Difference]: With dead ends: 10879 [2024-10-12 20:22:57,981 INFO L226 Difference]: Without dead ends: 10812 [2024-10-12 20:22:57,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=412, Invalid=1940, Unknown=0, NotChecked=0, Total=2352 [2024-10-12 20:22:57,984 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 3222 mSDsluCounter, 5678 mSDsCounter, 0 mSdLazyCounter, 2987 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3222 SdHoareTripleChecker+Valid, 5992 SdHoareTripleChecker+Invalid, 2991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:57,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3222 Valid, 5992 Invalid, 2991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2987 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 20:22:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10812 states. [2024-10-12 20:22:58,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10812 to 3897. [2024-10-12 20:22:58,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3897 states, 3896 states have (on average 1.3298254620123204) internal successors, (5181), 3896 states have internal predecessors, (5181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:58,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3897 states to 3897 states and 5181 transitions. [2024-10-12 20:22:58,035 INFO L78 Accepts]: Start accepts. Automaton has 3897 states and 5181 transitions. Word has length 77 [2024-10-12 20:22:58,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:58,036 INFO L471 AbstractCegarLoop]: Abstraction has 3897 states and 5181 transitions. [2024-10-12 20:22:58,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:58,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3897 states and 5181 transitions. [2024-10-12 20:22:58,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 20:22:58,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:58,038 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:58,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-12 20:22:58,039 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:58,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:58,039 INFO L85 PathProgramCache]: Analyzing trace with hash -989819669, now seen corresponding path program 1 times [2024-10-12 20:22:58,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:58,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094427102] [2024-10-12 20:22:58,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:58,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:58,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:58,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:58,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094427102] [2024-10-12 20:22:58,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094427102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:58,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:58,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 20:22:58,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931325736] [2024-10-12 20:22:58,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:58,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:22:58,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:58,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:22:58,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:22:58,516 INFO L87 Difference]: Start difference. First operand 3897 states and 5181 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:59,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:59,202 INFO L93 Difference]: Finished difference Result 5992 states and 8041 transitions. [2024-10-12 20:22:59,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:22:59,202 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-12 20:22:59,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:59,209 INFO L225 Difference]: With dead ends: 5992 [2024-10-12 20:22:59,210 INFO L226 Difference]: Without dead ends: 5915 [2024-10-12 20:22:59,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-10-12 20:22:59,212 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 2247 mSDsluCounter, 2069 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2247 SdHoareTripleChecker+Valid, 2438 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:59,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2247 Valid, 2438 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:22:59,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5915 states. [2024-10-12 20:22:59,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5915 to 3877. [2024-10-12 20:22:59,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3877 states, 3876 states have (on average 1.3299793601651186) internal successors, (5155), 3876 states have internal predecessors, (5155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3877 states to 3877 states and 5155 transitions. [2024-10-12 20:22:59,262 INFO L78 Accepts]: Start accepts. Automaton has 3877 states and 5155 transitions. Word has length 78 [2024-10-12 20:22:59,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:59,262 INFO L471 AbstractCegarLoop]: Abstraction has 3877 states and 5155 transitions. [2024-10-12 20:22:59,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:59,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3877 states and 5155 transitions. [2024-10-12 20:22:59,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 20:22:59,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:59,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:59,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-12 20:22:59,267 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:59,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:59,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1297092136, now seen corresponding path program 1 times [2024-10-12 20:22:59,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:59,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012984914] [2024-10-12 20:22:59,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:59,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:59,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:59,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:59,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012984914] [2024-10-12 20:22:59,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012984914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:59,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:59,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:22:59,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697184997] [2024-10-12 20:22:59,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:59,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:22:59,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:59,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:22:59,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:22:59,410 INFO L87 Difference]: Start difference. First operand 3877 states and 5155 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:59,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:59,539 INFO L93 Difference]: Finished difference Result 11114 states and 15249 transitions. [2024-10-12 20:22:59,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:22:59,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-10-12 20:22:59,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:59,550 INFO L225 Difference]: With dead ends: 11114 [2024-10-12 20:22:59,551 INFO L226 Difference]: Without dead ends: 8304 [2024-10-12 20:22:59,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:22:59,558 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 1760 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:59,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 1211 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:22:59,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8304 states. [2024-10-12 20:22:59,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8304 to 6321. [2024-10-12 20:22:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6321 states, 6320 states have (on average 1.3382911392405064) internal successors, (8458), 6320 states have internal predecessors, (8458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6321 states to 6321 states and 8458 transitions. [2024-10-12 20:22:59,661 INFO L78 Accepts]: Start accepts. Automaton has 6321 states and 8458 transitions. Word has length 81 [2024-10-12 20:22:59,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:22:59,662 INFO L471 AbstractCegarLoop]: Abstraction has 6321 states and 8458 transitions. [2024-10-12 20:22:59,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:59,662 INFO L276 IsEmpty]: Start isEmpty. Operand 6321 states and 8458 transitions. [2024-10-12 20:22:59,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 20:22:59,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:22:59,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:22:59,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-12 20:22:59,669 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:22:59,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:22:59,670 INFO L85 PathProgramCache]: Analyzing trace with hash 866141711, now seen corresponding path program 1 times [2024-10-12 20:22:59,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:22:59,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618265144] [2024-10-12 20:22:59,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:22:59,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:22:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:22:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:22:59,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:22:59,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618265144] [2024-10-12 20:22:59,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618265144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:22:59,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:22:59,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:22:59,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446879451] [2024-10-12 20:22:59,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:22:59,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:22:59,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:22:59,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:22:59,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:22:59,832 INFO L87 Difference]: Start difference. First operand 6321 states and 8458 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:22:59,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:22:59,947 INFO L93 Difference]: Finished difference Result 6329 states and 8462 transitions. [2024-10-12 20:22:59,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:22:59,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-10-12 20:22:59,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:22:59,953 INFO L225 Difference]: With dead ends: 6329 [2024-10-12 20:22:59,953 INFO L226 Difference]: Without dead ends: 5894 [2024-10-12 20:22:59,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:22:59,955 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 1132 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:22:59,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 1079 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:22:59,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5894 states. [2024-10-12 20:22:59,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5894 to 5888. [2024-10-12 20:23:00,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5888 states, 5887 states have (on average 1.3405809410565652) internal successors, (7892), 5887 states have internal predecessors, (7892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:00,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5888 states to 5888 states and 7892 transitions. [2024-10-12 20:23:00,012 INFO L78 Accepts]: Start accepts. Automaton has 5888 states and 7892 transitions. Word has length 82 [2024-10-12 20:23:00,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:00,012 INFO L471 AbstractCegarLoop]: Abstraction has 5888 states and 7892 transitions. [2024-10-12 20:23:00,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:00,012 INFO L276 IsEmpty]: Start isEmpty. Operand 5888 states and 7892 transitions. [2024-10-12 20:23:00,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 20:23:00,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:00,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:00,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-12 20:23:00,019 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:00,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:00,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1586247599, now seen corresponding path program 1 times [2024-10-12 20:23:00,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:00,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422260206] [2024-10-12 20:23:00,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:00,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:00,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:23:00,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:00,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422260206] [2024-10-12 20:23:00,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422260206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:00,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:00,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:00,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381784929] [2024-10-12 20:23:00,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:00,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:00,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:00,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:00,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:00,113 INFO L87 Difference]: Start difference. First operand 5888 states and 7892 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:00,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:00,168 INFO L93 Difference]: Finished difference Result 15348 states and 20870 transitions. [2024-10-12 20:23:00,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:00,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-10-12 20:23:00,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:00,181 INFO L225 Difference]: With dead ends: 15348 [2024-10-12 20:23:00,181 INFO L226 Difference]: Without dead ends: 10458 [2024-10-12 20:23:00,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:00,188 INFO L432 NwaCegarLoop]: 447 mSDtfsCounter, 145 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:00,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 757 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:23:00,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10458 states. [2024-10-12 20:23:00,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10458 to 9960. [2024-10-12 20:23:00,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9960 states, 9959 states have (on average 1.348528968771965) internal successors, (13430), 9959 states have internal predecessors, (13430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:00,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9960 states to 9960 states and 13430 transitions. [2024-10-12 20:23:00,292 INFO L78 Accepts]: Start accepts. Automaton has 9960 states and 13430 transitions. Word has length 83 [2024-10-12 20:23:00,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:00,293 INFO L471 AbstractCegarLoop]: Abstraction has 9960 states and 13430 transitions. [2024-10-12 20:23:00,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:00,293 INFO L276 IsEmpty]: Start isEmpty. Operand 9960 states and 13430 transitions. [2024-10-12 20:23:00,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 20:23:00,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:00,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:00,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-12 20:23:00,298 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:00,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:00,299 INFO L85 PathProgramCache]: Analyzing trace with hash -623918632, now seen corresponding path program 1 times [2024-10-12 20:23:00,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:00,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805665618] [2024-10-12 20:23:00,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:00,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:00,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:23:00,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:00,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805665618] [2024-10-12 20:23:00,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805665618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:00,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:00,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:00,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622945462] [2024-10-12 20:23:00,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:00,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:00,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:00,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:00,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:00,391 INFO L87 Difference]: Start difference. First operand 9960 states and 13430 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:00,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:00,479 INFO L93 Difference]: Finished difference Result 27244 states and 37000 transitions. [2024-10-12 20:23:00,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:00,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-12 20:23:00,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:00,502 INFO L225 Difference]: With dead ends: 27244 [2024-10-12 20:23:00,502 INFO L226 Difference]: Without dead ends: 18282 [2024-10-12 20:23:00,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:00,515 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 123 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:00,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 752 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:23:00,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18282 states. [2024-10-12 20:23:00,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18282 to 17288. [2024-10-12 20:23:00,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17288 states, 17287 states have (on average 1.34864348932724) internal successors, (23314), 17287 states have internal predecessors, (23314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17288 states to 17288 states and 23314 transitions. [2024-10-12 20:23:00,747 INFO L78 Accepts]: Start accepts. Automaton has 17288 states and 23314 transitions. Word has length 84 [2024-10-12 20:23:00,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:00,747 INFO L471 AbstractCegarLoop]: Abstraction has 17288 states and 23314 transitions. [2024-10-12 20:23:00,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 17288 states and 23314 transitions. [2024-10-12 20:23:00,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 20:23:00,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:00,751 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:00,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-12 20:23:00,752 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:00,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:00,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1942903474, now seen corresponding path program 1 times [2024-10-12 20:23:00,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:00,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124884394] [2024-10-12 20:23:00,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:00,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:00,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:23:00,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:00,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124884394] [2024-10-12 20:23:00,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124884394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:00,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:00,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:00,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994493156] [2024-10-12 20:23:00,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:00,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:00,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:00,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:00,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:00,848 INFO L87 Difference]: Start difference. First operand 17288 states and 23314 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:01,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:01,002 INFO L93 Difference]: Finished difference Result 48588 states and 65684 transitions. [2024-10-12 20:23:01,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:01,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-12 20:23:01,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:01,050 INFO L225 Difference]: With dead ends: 48588 [2024-10-12 20:23:01,050 INFO L226 Difference]: Without dead ends: 32298 [2024-10-12 20:23:01,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:01,069 INFO L432 NwaCegarLoop]: 411 mSDtfsCounter, 99 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:01,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 743 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:23:01,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32298 states. [2024-10-12 20:23:01,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32298 to 30312. [2024-10-12 20:23:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30312 states, 30311 states have (on average 1.3426808749298935) internal successors, (40698), 30311 states have internal predecessors, (40698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30312 states to 30312 states and 40698 transitions. [2024-10-12 20:23:01,363 INFO L78 Accepts]: Start accepts. Automaton has 30312 states and 40698 transitions. Word has length 87 [2024-10-12 20:23:01,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:01,364 INFO L471 AbstractCegarLoop]: Abstraction has 30312 states and 40698 transitions. [2024-10-12 20:23:01,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:01,364 INFO L276 IsEmpty]: Start isEmpty. Operand 30312 states and 40698 transitions. [2024-10-12 20:23:01,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-12 20:23:01,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:01,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:01,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-12 20:23:01,368 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:01,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:01,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1865032874, now seen corresponding path program 1 times [2024-10-12 20:23:01,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:01,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556601762] [2024-10-12 20:23:01,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:01,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:23:01,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:01,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556601762] [2024-10-12 20:23:01,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556601762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:01,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:01,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:23:01,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391141347] [2024-10-12 20:23:01,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:01,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:23:01,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:01,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:23:01,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:23:01,654 INFO L87 Difference]: Start difference. First operand 30312 states and 40698 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:01,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:01,756 INFO L93 Difference]: Finished difference Result 32522 states and 43643 transitions. [2024-10-12 20:23:01,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:23:01,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-10-12 20:23:01,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:01,799 INFO L225 Difference]: With dead ends: 32522 [2024-10-12 20:23:01,799 INFO L226 Difference]: Without dead ends: 32520 [2024-10-12 20:23:01,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:23:01,814 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 0 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:01,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1868 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:23:01,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32520 states. [2024-10-12 20:23:02,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32520 to 32520. [2024-10-12 20:23:02,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32520 states, 32519 states have (on average 1.3194132660905933) internal successors, (42906), 32519 states have internal predecessors, (42906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32520 states to 32520 states and 42906 transitions. [2024-10-12 20:23:02,137 INFO L78 Accepts]: Start accepts. Automaton has 32520 states and 42906 transitions. Word has length 88 [2024-10-12 20:23:02,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:02,137 INFO L471 AbstractCegarLoop]: Abstraction has 32520 states and 42906 transitions. [2024-10-12 20:23:02,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 32520 states and 42906 transitions. [2024-10-12 20:23:02,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 20:23:02,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:02,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:02,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-12 20:23:02,141 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:02,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:02,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1564998450, now seen corresponding path program 1 times [2024-10-12 20:23:02,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:02,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775079411] [2024-10-12 20:23:02,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:02,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:23:02,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:02,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775079411] [2024-10-12 20:23:02,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775079411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:02,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:02,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:02,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064396746] [2024-10-12 20:23:02,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:02,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:02,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:02,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:02,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:02,199 INFO L87 Difference]: Start difference. First operand 32520 states and 42906 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:02,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:02,378 INFO L93 Difference]: Finished difference Result 89548 states and 118044 transitions. [2024-10-12 20:23:02,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:02,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-10-12 20:23:02,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:02,445 INFO L225 Difference]: With dead ends: 89548 [2024-10-12 20:23:02,445 INFO L226 Difference]: Without dead ends: 58026 [2024-10-12 20:23:02,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:02,477 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 263 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:02,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 549 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:23:02,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58026 states. [2024-10-12 20:23:03,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58026 to 57288. [2024-10-12 20:23:03,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57288 states, 57287 states have (on average 1.2933126189187774) internal successors, (74090), 57287 states have internal predecessors, (74090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:03,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57288 states to 57288 states and 74090 transitions. [2024-10-12 20:23:03,383 INFO L78 Accepts]: Start accepts. Automaton has 57288 states and 74090 transitions. Word has length 89 [2024-10-12 20:23:03,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:03,383 INFO L471 AbstractCegarLoop]: Abstraction has 57288 states and 74090 transitions. [2024-10-12 20:23:03,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand 57288 states and 74090 transitions. [2024-10-12 20:23:03,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 20:23:03,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:03,390 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:03,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-12 20:23:03,390 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:03,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:03,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1424916206, now seen corresponding path program 1 times [2024-10-12 20:23:03,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:03,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031859332] [2024-10-12 20:23:03,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:03,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:03,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:23:03,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:03,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031859332] [2024-10-12 20:23:03,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031859332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:03,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:03,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:23:03,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753865659] [2024-10-12 20:23:03,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:03,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:23:03,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:03,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:23:03,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:03,521 INFO L87 Difference]: Start difference. First operand 57288 states and 74090 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:03,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:03,960 INFO L93 Difference]: Finished difference Result 146332 states and 188828 transitions. [2024-10-12 20:23:03,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:23:03,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-10-12 20:23:03,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:04,230 INFO L225 Difference]: With dead ends: 146332 [2024-10-12 20:23:04,230 INFO L226 Difference]: Without dead ends: 90042 [2024-10-12 20:23:04,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:23:04,262 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 161 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:04,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 769 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:23:04,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90042 states. [2024-10-12 20:23:05,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90042 to 83640. [2024-10-12 20:23:05,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83640 states, 83639 states have (on average 1.2812443955570965) internal successors, (107162), 83639 states have internal predecessors, (107162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:05,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83640 states to 83640 states and 107162 transitions. [2024-10-12 20:23:05,460 INFO L78 Accepts]: Start accepts. Automaton has 83640 states and 107162 transitions. Word has length 91 [2024-10-12 20:23:05,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:05,460 INFO L471 AbstractCegarLoop]: Abstraction has 83640 states and 107162 transitions. [2024-10-12 20:23:05,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:05,460 INFO L276 IsEmpty]: Start isEmpty. Operand 83640 states and 107162 transitions. [2024-10-12 20:23:05,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 20:23:05,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:05,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:05,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-12 20:23:05,463 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:05,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:05,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1116278260, now seen corresponding path program 1 times [2024-10-12 20:23:05,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:05,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376197081] [2024-10-12 20:23:05,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:05,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:05,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:23:05,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:05,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376197081] [2024-10-12 20:23:05,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376197081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:05,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:05,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:23:05,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984429640] [2024-10-12 20:23:05,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:05,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:23:05,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:05,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:23:05,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:23:05,767 INFO L87 Difference]: Start difference. First operand 83640 states and 107162 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:06,411 INFO L93 Difference]: Finished difference Result 134418 states and 173231 transitions. [2024-10-12 20:23:06,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:23:06,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-10-12 20:23:06,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:06,573 INFO L225 Difference]: With dead ends: 134418 [2024-10-12 20:23:06,573 INFO L226 Difference]: Without dead ends: 117352 [2024-10-12 20:23:06,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:23:06,613 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 1262 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:06,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 1462 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:23:06,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117352 states. [2024-10-12 20:23:07,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117352 to 96752. [2024-10-12 20:23:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96752 states, 96751 states have (on average 1.279428636396523) internal successors, (123786), 96751 states have internal predecessors, (123786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:07,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96752 states to 96752 states and 123786 transitions. [2024-10-12 20:23:07,866 INFO L78 Accepts]: Start accepts. Automaton has 96752 states and 123786 transitions. Word has length 91 [2024-10-12 20:23:07,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:07,867 INFO L471 AbstractCegarLoop]: Abstraction has 96752 states and 123786 transitions. [2024-10-12 20:23:07,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:07,867 INFO L276 IsEmpty]: Start isEmpty. Operand 96752 states and 123786 transitions. [2024-10-12 20:23:07,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-12 20:23:07,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:07,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:23:07,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-12 20:23:07,871 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:07,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:07,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1804659486, now seen corresponding path program 1 times [2024-10-12 20:23:07,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:07,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054183403] [2024-10-12 20:23:07,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:07,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:08,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:23:08,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:08,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054183403] [2024-10-12 20:23:08,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054183403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:08,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:08,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:23:08,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548941807] [2024-10-12 20:23:08,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:08,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:23:08,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:08,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:23:08,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:23:08,316 INFO L87 Difference]: Start difference. First operand 96752 states and 123786 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:08,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:08,703 INFO L93 Difference]: Finished difference Result 151518 states and 195047 transitions. [2024-10-12 20:23:08,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:23:08,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-10-12 20:23:08,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:09,248 INFO L225 Difference]: With dead ends: 151518 [2024-10-12 20:23:09,248 INFO L226 Difference]: Without dead ends: 125596 [2024-10-12 20:23:09,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:23:09,284 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 1446 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1446 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:09,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1446 Valid, 1269 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:23:09,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125596 states. [2024-10-12 20:23:10,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125596 to 114680. [2024-10-12 20:23:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114680 states, 114679 states have (on average 1.2771823960794915) internal successors, (146466), 114679 states have internal predecessors, (146466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:10,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114680 states to 114680 states and 146466 transitions. [2024-10-12 20:23:10,989 INFO L78 Accepts]: Start accepts. Automaton has 114680 states and 146466 transitions. Word has length 98 [2024-10-12 20:23:10,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:10,989 INFO L471 AbstractCegarLoop]: Abstraction has 114680 states and 146466 transitions. [2024-10-12 20:23:10,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:10,989 INFO L276 IsEmpty]: Start isEmpty. Operand 114680 states and 146466 transitions. [2024-10-12 20:23:11,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 20:23:11,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:11,003 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:23:11,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-12 20:23:11,003 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:11,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:11,004 INFO L85 PathProgramCache]: Analyzing trace with hash -951617293, now seen corresponding path program 1 times [2024-10-12 20:23:11,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:11,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245988128] [2024-10-12 20:23:11,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:11,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:11,102 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:23:11,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:11,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245988128] [2024-10-12 20:23:11,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245988128] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:23:11,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420903789] [2024-10-12 20:23:11,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:11,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:23:11,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:23:11,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:23:11,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 20:23:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:11,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 20:23:11,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:23:12,196 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:23:12,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:23:12,357 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:23:12,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420903789] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:23:12,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:23:12,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-10-12 20:23:12,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372468120] [2024-10-12 20:23:12,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:23:12,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 20:23:12,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:12,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 20:23:12,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-12 20:23:12,360 INFO L87 Difference]: Start difference. First operand 114680 states and 146466 transitions. Second operand has 14 states, 14 states have (on average 21.428571428571427) internal successors, (300), 14 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:13,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:13,312 INFO L93 Difference]: Finished difference Result 243500 states and 311156 transitions. [2024-10-12 20:23:13,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:23:13,313 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 21.428571428571427) internal successors, (300), 14 states have internal predecessors, (300), 0 states have call successors, (0), 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 113 [2024-10-12 20:23:13,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:13,475 INFO L225 Difference]: With dead ends: 243500 [2024-10-12 20:23:13,475 INFO L226 Difference]: Without dead ends: 129818 [2024-10-12 20:23:14,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-10-12 20:23:14,016 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 2375 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2375 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:14,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2375 Valid, 1238 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:23:14,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129818 states. [2024-10-12 20:23:15,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129818 to 112580. [2024-10-12 20:23:15,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112580 states, 112579 states have (on average 1.2554206379520159) internal successors, (141334), 112579 states have internal predecessors, (141334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:15,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112580 states to 112580 states and 141334 transitions. [2024-10-12 20:23:15,462 INFO L78 Accepts]: Start accepts. Automaton has 112580 states and 141334 transitions. Word has length 113 [2024-10-12 20:23:15,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:15,462 INFO L471 AbstractCegarLoop]: Abstraction has 112580 states and 141334 transitions. [2024-10-12 20:23:15,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 21.428571428571427) internal successors, (300), 14 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:15,462 INFO L276 IsEmpty]: Start isEmpty. Operand 112580 states and 141334 transitions. [2024-10-12 20:23:15,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 20:23:15,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:15,477 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:23:15,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 20:23:15,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-10-12 20:23:15,678 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:15,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:15,679 INFO L85 PathProgramCache]: Analyzing trace with hash -851960785, now seen corresponding path program 1 times [2024-10-12 20:23:15,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:15,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59317608] [2024-10-12 20:23:15,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:15,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:15,811 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:23:15,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:15,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59317608] [2024-10-12 20:23:15,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59317608] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:23:15,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108864958] [2024-10-12 20:23:15,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:15,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:23:15,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:23:15,814 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:23:15,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 20:23:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:16,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 20:23:16,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:23:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:23:16,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:23:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:23:16,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108864958] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:23:16,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:23:16,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-10-12 20:23:16,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990485926] [2024-10-12 20:23:16,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:23:16,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 20:23:16,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:16,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 20:23:16,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-12 20:23:16,651 INFO L87 Difference]: Start difference. First operand 112580 states and 141334 transitions. Second operand has 14 states, 14 states have (on average 21.714285714285715) internal successors, (304), 14 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:18,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:18,106 INFO L93 Difference]: Finished difference Result 245797 states and 309504 transitions. [2024-10-12 20:23:18,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:23:18,106 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 21.714285714285715) internal successors, (304), 14 states have internal predecessors, (304), 0 states have call successors, (0), 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 113 [2024-10-12 20:23:18,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:18,287 INFO L225 Difference]: With dead ends: 245797 [2024-10-12 20:23:18,287 INFO L226 Difference]: Without dead ends: 134215 [2024-10-12 20:23:18,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-10-12 20:23:18,363 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 3069 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3069 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:18,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3069 Valid, 1249 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:23:18,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134215 states. [2024-10-12 20:23:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134215 to 117722. [2024-10-12 20:23:19,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117722 states, 117721 states have (on average 1.2434484926223868) internal successors, (146380), 117721 states have internal predecessors, (146380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:20,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117722 states to 117722 states and 146380 transitions. [2024-10-12 20:23:20,543 INFO L78 Accepts]: Start accepts. Automaton has 117722 states and 146380 transitions. Word has length 113 [2024-10-12 20:23:20,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:20,544 INFO L471 AbstractCegarLoop]: Abstraction has 117722 states and 146380 transitions. [2024-10-12 20:23:20,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 21.714285714285715) internal successors, (304), 14 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:20,544 INFO L276 IsEmpty]: Start isEmpty. Operand 117722 states and 146380 transitions. [2024-10-12 20:23:20,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-12 20:23:20,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:20,555 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:23:20,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 20:23:20,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2024-10-12 20:23:20,756 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:20,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:20,757 INFO L85 PathProgramCache]: Analyzing trace with hash -422997491, now seen corresponding path program 1 times [2024-10-12 20:23:20,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:20,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299262395] [2024-10-12 20:23:20,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:20,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:21,006 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-12 20:23:21,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:21,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299262395] [2024-10-12 20:23:21,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299262395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:21,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:21,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:23:21,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479176066] [2024-10-12 20:23:21,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:21,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:23:21,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:21,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:23:21,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:23:21,009 INFO L87 Difference]: Start difference. First operand 117722 states and 146380 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:21,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:23:21,993 INFO L93 Difference]: Finished difference Result 222142 states and 275597 transitions. [2024-10-12 20:23:21,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:23:21,994 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 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 114 [2024-10-12 20:23:21,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:23:22,704 INFO L225 Difference]: With dead ends: 222142 [2024-10-12 20:23:22,705 INFO L226 Difference]: Without dead ends: 177660 [2024-10-12 20:23:22,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:23:22,769 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 1186 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:23:22,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 1049 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:23:22,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177660 states. [2024-10-12 20:23:24,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177660 to 117670. [2024-10-12 20:23:24,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117670 states, 117669 states have (on average 1.2434201021509488) internal successors, (146312), 117669 states have internal predecessors, (146312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:24,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117670 states to 117670 states and 146312 transitions. [2024-10-12 20:23:24,691 INFO L78 Accepts]: Start accepts. Automaton has 117670 states and 146312 transitions. Word has length 114 [2024-10-12 20:23:24,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:23:24,691 INFO L471 AbstractCegarLoop]: Abstraction has 117670 states and 146312 transitions. [2024-10-12 20:23:24,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:23:24,691 INFO L276 IsEmpty]: Start isEmpty. Operand 117670 states and 146312 transitions. [2024-10-12 20:23:24,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-12 20:23:24,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:23:24,704 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:23:24,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-12 20:23:24,705 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:23:24,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:23:24,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1876836156, now seen corresponding path program 1 times [2024-10-12 20:23:24,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:23:24,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180285787] [2024-10-12 20:23:24,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:23:24,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:23:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:23:24,971 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-12 20:23:24,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:23:24,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180285787] [2024-10-12 20:23:24,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180285787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:23:24,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:23:24,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:23:24,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854349126] [2024-10-12 20:23:24,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:23:24,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:23:24,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:23:24,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:23:24,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:23:24,974 INFO L87 Difference]: Start difference. First operand 117670 states and 146312 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)