./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label02.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/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label02.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 5d7ba9bef9a338f3463d946053d41baba5b0d351a2820fb2d5a03dd7d7748229 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:33:29,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:33:29,686 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:33:29,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:33:29,693 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:33:29,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:33:29,717 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:33:29,717 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:33:29,718 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:33:29,718 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:33:29,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:33:29,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:33:29,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:33:29,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:33:29,722 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:33:29,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:33:29,723 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:33:29,723 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:33:29,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:33:29,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:33:29,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:33:29,724 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:33:29,724 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:33:29,724 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:33:29,724 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:33:29,725 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:33:29,725 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:33:29,725 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:33:29,725 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:33:29,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:33:29,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:33:29,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:33:29,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:33:29,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:33:29,727 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:33:29,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:33:29,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:33:29,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:33:29,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:33:29,729 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:33:29,729 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:33:29,729 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:33:29,729 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 -> 5d7ba9bef9a338f3463d946053d41baba5b0d351a2820fb2d5a03dd7d7748229 [2024-10-12 21:33:29,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:33:29,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:33:29,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:33:29,968 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:33:29,968 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:33:29,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-10-12 21:33:31,289 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:33:31,631 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:33:31,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-10-12 21:33:31,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d043957/c8dd4cdfc1fa4943b7bca536743a7b14/FLAG5dded35bb [2024-10-12 21:33:31,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d043957/c8dd4cdfc1fa4943b7bca536743a7b14 [2024-10-12 21:33:31,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:33:31,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:33:31,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:33:31,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:33:31,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:33:31,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:33:31" (1/1) ... [2024-10-12 21:33:31,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@161e1002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:33:31, skipping insertion in model container [2024-10-12 21:33:31,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:33:31" (1/1) ... [2024-10-12 21:33:31,866 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:33:32,160 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/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label02.c[15510,15523] [2024-10-12 21:33:32,208 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/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label02.c[22800,22813] [2024-10-12 21:33:32,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:33:32,629 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:33:32,661 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/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label02.c[15510,15523] [2024-10-12 21:33:32,672 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/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label02.c[22800,22813] [2024-10-12 21:33:32,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:33:33,001 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:33:33,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:33:33 WrapperNode [2024-10-12 21:33:33,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:33:33,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:33:33,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:33:33,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:33:33,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:33:33" (1/1) ... [2024-10-12 21:33:33,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:33:33" (1/1) ... [2024-10-12 21:33:33,418 INFO L138 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5157 [2024-10-12 21:33:33,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:33:33,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:33:33,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:33:33,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:33:33,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:33:33" (1/1) ... [2024-10-12 21:33:33,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:33:33" (1/1) ... [2024-10-12 21:33:33,451 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:33:33" (1/1) ... [2024-10-12 21:33:33,591 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 21:33:33,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:33:33" (1/1) ... [2024-10-12 21:33:33,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:33:33" (1/1) ... [2024-10-12 21:33:33,752 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:33:33" (1/1) ... [2024-10-12 21:33:33,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:33:33" (1/1) ... [2024-10-12 21:33:33,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:33:33" (1/1) ... [2024-10-12 21:33:33,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:33:33" (1/1) ... [2024-10-12 21:33:33,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:33:33,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:33:33,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:33:33,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:33:33,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:33:33" (1/1) ... [2024-10-12 21:33:33,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:33:34,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:33:34,017 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 21:33:34,024 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 21:33:34,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:33:34,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:33:34,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:33:34,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:33:34,160 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:33:34,162 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:33:37,283 INFO L? ?]: Removed 749 outVars from TransFormulas that were not future-live. [2024-10-12 21:33:37,284 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:33:37,345 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:33:37,346 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 21:33:37,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:33:37 BoogieIcfgContainer [2024-10-12 21:33:37,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:33:37,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:33:37,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:33:37,350 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:33:37,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:33:31" (1/3) ... [2024-10-12 21:33:37,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ac0637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:33:37, skipping insertion in model container [2024-10-12 21:33:37,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:33:33" (2/3) ... [2024-10-12 21:33:37,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ac0637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:33:37, skipping insertion in model container [2024-10-12 21:33:37,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:33:37" (3/3) ... [2024-10-12 21:33:37,353 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-10-12 21:33:37,364 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:33:37,365 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:33:37,445 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:33:37,454 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;@7109fba8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:33:37,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:33:37,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 851 states, 848 states have (on average 1.9728773584905661) internal successors, (1673), 850 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states 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 21:33:37,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 21:33:37,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:33:37,482 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] [2024-10-12 21:33:37,483 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:33:37,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:33:37,487 INFO L85 PathProgramCache]: Analyzing trace with hash -150308239, now seen corresponding path program 1 times [2024-10-12 21:33:37,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:33:37,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729859147] [2024-10-12 21:33:37,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:33:37,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:33:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:33:37,804 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 21:33:37,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:33:37,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729859147] [2024-10-12 21:33:37,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729859147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:33:37,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:33:37,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 21:33:37,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602656068] [2024-10-12 21:33:37,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:33:37,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 21:33:37,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:33:37,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 21:33:37,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 21:33:37,846 INFO L87 Difference]: Start difference. First operand has 851 states, 848 states have (on average 1.9728773584905661) internal successors, (1673), 850 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 21:33:37,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:33:37,918 INFO L93 Difference]: Finished difference Result 1657 states and 3259 transitions. [2024-10-12 21:33:37,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 21:33:37,924 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-12 21:33:37,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:33:37,946 INFO L225 Difference]: With dead ends: 1657 [2024-10-12 21:33:37,946 INFO L226 Difference]: Without dead ends: 847 [2024-10-12 21:33:37,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 21:33:37,959 INFO L432 NwaCegarLoop]: 1601 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:33:37,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1601 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:33:37,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-10-12 21:33:38,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2024-10-12 21:33:38,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 845 states have (on average 1.8958579881656805) internal successors, (1602), 846 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states 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 21:33:38,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1602 transitions. [2024-10-12 21:33:38,014 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1602 transitions. Word has length 23 [2024-10-12 21:33:38,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:33:38,014 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1602 transitions. [2024-10-12 21:33:38,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 21:33:38,015 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1602 transitions. [2024-10-12 21:33:38,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 21:33:38,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:33:38,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] [2024-10-12 21:33:38,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:33:38,018 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:33:38,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:33:38,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1839251981, now seen corresponding path program 1 times [2024-10-12 21:33:38,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:33:38,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253056044] [2024-10-12 21:33:38,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:33:38,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:33:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:33:38,135 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 21:33:38,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:33:38,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253056044] [2024-10-12 21:33:38,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253056044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:33:38,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:33:38,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:33:38,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788991835] [2024-10-12 21:33:38,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:33:38,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:33:38,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:33:38,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:33:38,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:33:38,138 INFO L87 Difference]: Start difference. First operand 847 states and 1602 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 21:33:38,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:33:38,209 INFO L93 Difference]: Finished difference Result 899 states and 1684 transitions. [2024-10-12 21:33:38,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:33:38,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-12 21:33:38,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:33:38,213 INFO L225 Difference]: With dead ends: 899 [2024-10-12 21:33:38,213 INFO L226 Difference]: Without dead ends: 847 [2024-10-12 21:33:38,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:33:38,214 INFO L432 NwaCegarLoop]: 1599 mSDtfsCounter, 0 mSDsluCounter, 3154 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4753 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:33:38,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4753 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:33:38,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-10-12 21:33:38,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2024-10-12 21:33:38,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 845 states have (on average 1.8485207100591716) internal successors, (1562), 846 states have internal predecessors, (1562), 0 states have call successors, (0), 0 states 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 21:33:38,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1562 transitions. [2024-10-12 21:33:38,240 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1562 transitions. Word has length 23 [2024-10-12 21:33:38,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:33:38,240 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1562 transitions. [2024-10-12 21:33:38,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 21:33:38,241 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1562 transitions. [2024-10-12 21:33:38,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 21:33:38,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:33:38,242 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 21:33:38,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:33:38,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:33:38,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:33:38,243 INFO L85 PathProgramCache]: Analyzing trace with hash -138572409, now seen corresponding path program 1 times [2024-10-12 21:33:38,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:33:38,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63194883] [2024-10-12 21:33:38,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:33:38,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:33:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:33:38,566 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 21:33:38,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:33:38,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63194883] [2024-10-12 21:33:38,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63194883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:33:38,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:33:38,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:33:38,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691950266] [2024-10-12 21:33:38,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:33:38,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:33:38,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:33:38,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:33:38,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:33:38,570 INFO L87 Difference]: Start difference. First operand 847 states and 1562 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 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 21:33:38,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:33:38,877 INFO L93 Difference]: Finished difference Result 1435 states and 2510 transitions. [2024-10-12 21:33:38,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 21:33:38,878 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 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 21:33:38,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:33:38,884 INFO L225 Difference]: With dead ends: 1435 [2024-10-12 21:33:38,885 INFO L226 Difference]: Without dead ends: 1386 [2024-10-12 21:33:38,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:33:38,888 INFO L432 NwaCegarLoop]: 1553 mSDtfsCounter, 9829 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9829 SdHoareTripleChecker+Valid, 3039 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:33:38,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9829 Valid, 3039 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:33:38,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-10-12 21:33:38,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 894. [2024-10-12 21:33:38,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 892 states have (on average 1.836322869955157) internal successors, (1638), 893 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states 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 21:33:38,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1638 transitions. [2024-10-12 21:33:38,914 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1638 transitions. Word has length 62 [2024-10-12 21:33:38,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:33:38,917 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1638 transitions. [2024-10-12 21:33:38,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 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 21:33:38,918 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1638 transitions. [2024-10-12 21:33:38,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 21:33:38,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:33:38,921 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 21:33:38,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:33:38,921 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:33:38,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:33:38,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1430144389, now seen corresponding path program 1 times [2024-10-12 21:33:38,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:33:38,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534811626] [2024-10-12 21:33:38,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:33:38,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:33:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:33:39,100 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 21:33:39,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:33:39,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534811626] [2024-10-12 21:33:39,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534811626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:33:39,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:33:39,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:33:39,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881777512] [2024-10-12 21:33:39,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:33:39,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:33:39,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:33:39,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:33:39,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:33:39,103 INFO L87 Difference]: Start difference. First operand 894 states and 1638 transitions. Second operand has 4 states, 4 states have (on average 15.5) 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 21:33:44,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:33:44,157 INFO L93 Difference]: Finished difference Result 3149 states and 5947 transitions. [2024-10-12 21:33:44,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:33:44,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) 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 21:33:44,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:33:44,165 INFO L225 Difference]: With dead ends: 3149 [2024-10-12 21:33:44,165 INFO L226 Difference]: Without dead ends: 2396 [2024-10-12 21:33:44,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:33:44,168 INFO L432 NwaCegarLoop]: 813 mSDtfsCounter, 2440 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5157 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2440 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 6402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 5157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:33:44,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2440 Valid, 831 Invalid, 6402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 5157 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-12 21:33:44,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2024-10-12 21:33:44,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 2396. [2024-10-12 21:33:44,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2396 states, 2394 states have (on average 1.509607351712615) internal successors, (3614), 2395 states have internal predecessors, (3614), 0 states have call successors, (0), 0 states 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 21:33:44,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 3614 transitions. [2024-10-12 21:33:44,198 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 3614 transitions. Word has length 62 [2024-10-12 21:33:44,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:33:44,199 INFO L471 AbstractCegarLoop]: Abstraction has 2396 states and 3614 transitions. [2024-10-12 21:33:44,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) 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 21:33:44,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 3614 transitions. [2024-10-12 21:33:44,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 21:33:44,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:33:44,203 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 21:33:44,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:33:44,203 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:33:44,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:33:44,203 INFO L85 PathProgramCache]: Analyzing trace with hash -157852617, now seen corresponding path program 1 times [2024-10-12 21:33:44,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:33:44,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111690091] [2024-10-12 21:33:44,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:33:44,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:33:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:33:44,279 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 21:33:44,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:33:44,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111690091] [2024-10-12 21:33:44,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111690091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:33:44,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:33:44,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:33:44,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162817782] [2024-10-12 21:33:44,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:33:44,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:33:44,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:33:44,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:33:44,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:33:44,282 INFO L87 Difference]: Start difference. First operand 2396 states and 3614 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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 21:33:44,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:33:44,318 INFO L93 Difference]: Finished difference Result 2577 states and 3905 transitions. [2024-10-12 21:33:44,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:33:44,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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 21:33:44,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:33:44,325 INFO L225 Difference]: With dead ends: 2577 [2024-10-12 21:33:44,325 INFO L226 Difference]: Without dead ends: 2481 [2024-10-12 21:33:44,327 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 21:33:44,328 INFO L432 NwaCegarLoop]: 1555 mSDtfsCounter, 1490 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:33:44,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1626 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:33:44,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2024-10-12 21:33:44,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2477. [2024-10-12 21:33:44,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 2475 states have (on average 1.5119191919191919) internal successors, (3742), 2476 states have internal predecessors, (3742), 0 states have call successors, (0), 0 states 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 21:33:44,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3742 transitions. [2024-10-12 21:33:44,355 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3742 transitions. Word has length 64 [2024-10-12 21:33:44,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:33:44,361 INFO L471 AbstractCegarLoop]: Abstraction has 2477 states and 3742 transitions. [2024-10-12 21:33:44,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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 21:33:44,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3742 transitions. [2024-10-12 21:33:44,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 21:33:44,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:33:44,364 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 21:33:44,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:33:44,364 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:33:44,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:33:44,365 INFO L85 PathProgramCache]: Analyzing trace with hash -155707665, now seen corresponding path program 1 times [2024-10-12 21:33:44,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:33:44,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041386834] [2024-10-12 21:33:44,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:33:44,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:33:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:33:44,633 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 21:33:44,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:33:44,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041386834] [2024-10-12 21:33:44,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041386834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:33:44,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:33:44,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:33:44,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88302281] [2024-10-12 21:33:44,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:33:44,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:33:44,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:33:44,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:33:44,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:33:44,636 INFO L87 Difference]: Start difference. First operand 2477 states and 3742 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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 21:33:44,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:33:44,833 INFO L93 Difference]: Finished difference Result 2656 states and 4026 transitions. [2024-10-12 21:33:44,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 21:33:44,836 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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 21:33:44,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:33:44,842 INFO L225 Difference]: With dead ends: 2656 [2024-10-12 21:33:44,842 INFO L226 Difference]: Without dead ends: 2479 [2024-10-12 21:33:44,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-10-12 21:33:44,846 INFO L432 NwaCegarLoop]: 1551 mSDtfsCounter, 4519 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4519 SdHoareTripleChecker+Valid, 1930 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:33:44,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4519 Valid, 1930 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:33:44,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479 states. [2024-10-12 21:33:44,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479 to 2477. [2024-10-12 21:33:44,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 2475 states have (on average 1.511111111111111) internal successors, (3740), 2476 states have internal predecessors, (3740), 0 states have call successors, (0), 0 states 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 21:33:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3740 transitions. [2024-10-12 21:33:44,892 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3740 transitions. Word has length 64 [2024-10-12 21:33:44,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:33:44,893 INFO L471 AbstractCegarLoop]: Abstraction has 2477 states and 3740 transitions. [2024-10-12 21:33:44,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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 21:33:44,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3740 transitions. [2024-10-12 21:33:44,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-12 21:33:44,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:33:44,894 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 21:33:44,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:33:44,894 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:33:44,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:33:44,895 INFO L85 PathProgramCache]: Analyzing trace with hash -660670881, now seen corresponding path program 1 times [2024-10-12 21:33:44,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:33:44,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545476047] [2024-10-12 21:33:44,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:33:44,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:33:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:33:44,999 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 21:33:45,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:33:45,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545476047] [2024-10-12 21:33:45,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545476047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:33:45,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:33:45,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:33:45,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649953461] [2024-10-12 21:33:45,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:33:45,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:33:45,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:33:45,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:33:45,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:33:45,003 INFO L87 Difference]: Start difference. First operand 2477 states and 3740 transitions. Second operand has 4 states, 4 states have (on average 16.25) 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 21:33:45,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:33:45,060 INFO L93 Difference]: Finished difference Result 2483 states and 3747 transitions. [2024-10-12 21:33:45,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:33:45,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) 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 21:33:45,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:33:45,069 INFO L225 Difference]: With dead ends: 2483 [2024-10-12 21:33:45,070 INFO L226 Difference]: Without dead ends: 2481 [2024-10-12 21:33:45,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:33:45,070 INFO L432 NwaCegarLoop]: 1558 mSDtfsCounter, 0 mSDsluCounter, 3108 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4666 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:33:45,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4666 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:33:45,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2024-10-12 21:33:45,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2481. [2024-10-12 21:33:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2479 states have (on average 1.5098830173457038) internal successors, (3743), 2480 states have internal predecessors, (3743), 0 states have call successors, (0), 0 states 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 21:33:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3743 transitions. [2024-10-12 21:33:45,131 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3743 transitions. Word has length 65 [2024-10-12 21:33:45,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:33:45,135 INFO L471 AbstractCegarLoop]: Abstraction has 2481 states and 3743 transitions. [2024-10-12 21:33:45,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) 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 21:33:45,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3743 transitions. [2024-10-12 21:33:45,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 21:33:45,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:33:45,136 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 21:33:45,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:33:45,136 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:33:45,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:33:45,137 INFO L85 PathProgramCache]: Analyzing trace with hash -347651057, now seen corresponding path program 1 times [2024-10-12 21:33:45,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:33:45,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288130152] [2024-10-12 21:33:45,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:33:45,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:33:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:33:45,233 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 21:33:45,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:33:45,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288130152] [2024-10-12 21:33:45,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288130152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:33:45,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:33:45,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:33:45,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684138303] [2024-10-12 21:33:45,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:33:45,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:33:45,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:33:45,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:33:45,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:33:45,238 INFO L87 Difference]: Start difference. First operand 2481 states and 3743 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 21:33:45,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:33:45,285 INFO L93 Difference]: Finished difference Result 2827 states and 4283 transitions. [2024-10-12 21:33:45,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:33:45,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 21:33:45,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:33:45,292 INFO L225 Difference]: With dead ends: 2827 [2024-10-12 21:33:45,292 INFO L226 Difference]: Without dead ends: 2646 [2024-10-12 21:33:45,293 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 21:33:45,293 INFO L432 NwaCegarLoop]: 1604 mSDtfsCounter, 1503 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1691 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:33:45,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1691 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:33:45,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2024-10-12 21:33:45,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2644. [2024-10-12 21:33:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2642 states have (on average 1.5117335352006056) internal successors, (3994), 2643 states have internal predecessors, (3994), 0 states have call successors, (0), 0 states 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 21:33:45,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3994 transitions. [2024-10-12 21:33:45,325 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3994 transitions. Word has length 66 [2024-10-12 21:33:45,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:33:45,325 INFO L471 AbstractCegarLoop]: Abstraction has 2644 states and 3994 transitions. [2024-10-12 21:33:45,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 21:33:45,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3994 transitions. [2024-10-12 21:33:45,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 21:33:45,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:33:45,326 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 21:33:45,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:33:45,326 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:33:45,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:33:45,327 INFO L85 PathProgramCache]: Analyzing trace with hash -307707121, now seen corresponding path program 1 times [2024-10-12 21:33:45,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:33:45,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277135154] [2024-10-12 21:33:45,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:33:45,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:33:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:33:45,364 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 21:33:45,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:33:45,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277135154] [2024-10-12 21:33:45,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277135154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:33:45,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:33:45,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:33:45,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386934165] [2024-10-12 21:33:45,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:33:45,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:33:45,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:33:45,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:33:45,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:33:45,366 INFO L87 Difference]: Start difference. First operand 2644 states and 3994 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 21:33:45,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:33:45,395 INFO L93 Difference]: Finished difference Result 3300 states and 5008 transitions. [2024-10-12 21:33:45,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:33:45,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 21:33:45,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:33:45,403 INFO L225 Difference]: With dead ends: 3300 [2024-10-12 21:33:45,403 INFO L226 Difference]: Without dead ends: 2956 [2024-10-12 21:33:45,403 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 21:33:45,407 INFO L432 NwaCegarLoop]: 1602 mSDtfsCounter, 1501 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:33:45,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1693 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:33:45,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2024-10-12 21:33:45,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2954. [2024-10-12 21:33:45,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2954 states, 2952 states have (on average 1.5121951219512195) internal successors, (4464), 2953 states have internal predecessors, (4464), 0 states have call successors, (0), 0 states 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 21:33:45,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 4464 transitions. [2024-10-12 21:33:45,471 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 4464 transitions. Word has length 66 [2024-10-12 21:33:45,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:33:45,472 INFO L471 AbstractCegarLoop]: Abstraction has 2954 states and 4464 transitions. [2024-10-12 21:33:45,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 21:33:45,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 4464 transitions. [2024-10-12 21:33:45,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 21:33:45,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:33:45,473 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 21:33:45,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:33:45,473 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:33:45,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:33:45,473 INFO L85 PathProgramCache]: Analyzing trace with hash -933363185, now seen corresponding path program 1 times [2024-10-12 21:33:45,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:33:45,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631526142] [2024-10-12 21:33:45,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:33:45,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:33:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:33:45,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 21:33:45,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:33:45,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631526142] [2024-10-12 21:33:45,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631526142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:33:45,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:33:45,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:33:45,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422713586] [2024-10-12 21:33:45,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:33:45,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:33:45,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:33:45,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:33:45,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:33:45,515 INFO L87 Difference]: Start difference. First operand 2954 states and 4464 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 21:33:45,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:33:45,550 INFO L93 Difference]: Finished difference Result 4198 states and 6362 transitions. [2024-10-12 21:33:45,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:33:45,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 21:33:45,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:33:45,559 INFO L225 Difference]: With dead ends: 4198 [2024-10-12 21:33:45,559 INFO L226 Difference]: Without dead ends: 3544 [2024-10-12 21:33:45,561 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 21:33:45,561 INFO L432 NwaCegarLoop]: 1600 mSDtfsCounter, 1499 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:33:45,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 1695 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:33:45,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3544 states. [2024-10-12 21:33:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3544 to 3542. [2024-10-12 21:33:45,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3542 states, 3540 states have (on average 1.5084745762711864) internal successors, (5340), 3541 states have internal predecessors, (5340), 0 states have call successors, (0), 0 states 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 21:33:45,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 5340 transitions. [2024-10-12 21:33:45,612 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 5340 transitions. Word has length 66 [2024-10-12 21:33:45,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:33:45,612 INFO L471 AbstractCegarLoop]: Abstraction has 3542 states and 5340 transitions. [2024-10-12 21:33:45,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 21:33:45,612 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 5340 transitions. [2024-10-12 21:33:45,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 21:33:45,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:33:45,613 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 21:33:45,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:33:45,613 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:33:45,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:33:45,614 INFO L85 PathProgramCache]: Analyzing trace with hash -44629745, now seen corresponding path program 1 times [2024-10-12 21:33:45,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:33:45,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614308914] [2024-10-12 21:33:45,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:33:45,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:33:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:33:45,676 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 21:33:45,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:33:45,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614308914] [2024-10-12 21:33:45,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614308914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:33:45,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:33:45,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:33:45,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850266223] [2024-10-12 21:33:45,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:33:45,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:33:45,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:33:45,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:33:45,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:33:45,677 INFO L87 Difference]: Start difference. First operand 3542 states and 5340 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 21:33:45,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:33:45,758 INFO L93 Difference]: Finished difference Result 5898 states and 8878 transitions. [2024-10-12 21:33:45,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:33:45,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 21:33:45,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:33:45,769 INFO L225 Difference]: With dead ends: 5898 [2024-10-12 21:33:45,769 INFO L226 Difference]: Without dead ends: 4656 [2024-10-12 21:33:45,771 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 21:33:45,771 INFO L432 NwaCegarLoop]: 1598 mSDtfsCounter, 1497 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:33:45,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 1697 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:33:45,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4656 states. [2024-10-12 21:33:45,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4656 to 4654. [2024-10-12 21:33:45,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4654 states, 4652 states have (on average 1.4969905417024936) internal successors, (6964), 4653 states have internal predecessors, (6964), 0 states have call successors, (0), 0 states 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 21:33:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4654 states to 4654 states and 6964 transitions. [2024-10-12 21:33:45,840 INFO L78 Accepts]: Start accepts. Automaton has 4654 states and 6964 transitions. Word has length 66 [2024-10-12 21:33:45,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:33:45,841 INFO L471 AbstractCegarLoop]: Abstraction has 4654 states and 6964 transitions. [2024-10-12 21:33:45,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 21:33:45,841 INFO L276 IsEmpty]: Start isEmpty. Operand 4654 states and 6964 transitions. [2024-10-12 21:33:45,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 21:33:45,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:33:45,842 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 21:33:45,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:33:45,842 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:33:45,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:33:45,842 INFO L85 PathProgramCache]: Analyzing trace with hash -79067889, now seen corresponding path program 1 times [2024-10-12 21:33:45,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:33:45,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926410416] [2024-10-12 21:33:45,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:33:45,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:33:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:33:45,884 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 21:33:45,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:33:45,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926410416] [2024-10-12 21:33:45,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926410416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:33:45,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:33:45,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:33:45,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241757438] [2024-10-12 21:33:45,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:33:45,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:33:45,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:33:45,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:33:45,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:33:45,886 INFO L87 Difference]: Start difference. First operand 4654 states and 6964 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 21:33:45,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:33:45,988 INFO L93 Difference]: Finished difference Result 9106 states and 13526 transitions. [2024-10-12 21:33:45,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:33:45,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 21:33:45,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:33:46,002 INFO L225 Difference]: With dead ends: 9106 [2024-10-12 21:33:46,006 INFO L226 Difference]: Without dead ends: 6752 [2024-10-12 21:33:46,013 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 21:33:46,014 INFO L432 NwaCegarLoop]: 1614 mSDtfsCounter, 1505 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:33:46,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1697 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:33:46,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6752 states. [2024-10-12 21:33:46,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6752 to 6750. [2024-10-12 21:33:46,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6750 states, 6748 states have (on average 1.4754001185536456) internal successors, (9956), 6749 states have internal predecessors, (9956), 0 states have call successors, (0), 0 states 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 21:33:46,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6750 states to 6750 states and 9956 transitions. [2024-10-12 21:33:46,119 INFO L78 Accepts]: Start accepts. Automaton has 6750 states and 9956 transitions. Word has length 66 [2024-10-12 21:33:46,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:33:46,119 INFO L471 AbstractCegarLoop]: Abstraction has 6750 states and 9956 transitions. [2024-10-12 21:33:46,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 21:33:46,120 INFO L276 IsEmpty]: Start isEmpty. Operand 6750 states and 9956 transitions. [2024-10-12 21:33:46,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-12 21:33:46,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:33:46,120 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 21:33:46,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:33:46,121 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:33:46,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:33:46,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1522612916, now seen corresponding path program 1 times [2024-10-12 21:33:46,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:33:46,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260157189] [2024-10-12 21:33:46,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:33:46,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:33:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:33:46,157 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 21:33:46,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:33:46,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260157189] [2024-10-12 21:33:46,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260157189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:33:46,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:33:46,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:33:46,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254138173] [2024-10-12 21:33:46,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:33:46,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:33:46,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:33:46,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:33:46,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:33:46,159 INFO L87 Difference]: Start difference. First operand 6750 states and 9956 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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 21:33:46,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:33:46,320 INFO L93 Difference]: Finished difference Result 11365 states and 16810 transitions. [2024-10-12 21:33:46,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:33:46,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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 21:33:46,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:33:46,331 INFO L225 Difference]: With dead ends: 11365 [2024-10-12 21:33:46,331 INFO L226 Difference]: Without dead ends: 8866 [2024-10-12 21:33:46,333 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 21:33:46,334 INFO L432 NwaCegarLoop]: 1619 mSDtfsCounter, 1504 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:33:46,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1698 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:33:46,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8866 states. [2024-10-12 21:33:46,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8866 to 8864. [2024-10-12 21:33:46,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8864 states, 8862 states have (on average 1.4667118032046942) internal successors, (12998), 8863 states have internal predecessors, (12998), 0 states have call successors, (0), 0 states 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 21:33:46,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8864 states to 8864 states and 12998 transitions. [2024-10-12 21:33:46,466 INFO L78 Accepts]: Start accepts. Automaton has 8864 states and 12998 transitions. Word has length 68 [2024-10-12 21:33:46,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:33:46,466 INFO L471 AbstractCegarLoop]: Abstraction has 8864 states and 12998 transitions. [2024-10-12 21:33:46,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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 21:33:46,466 INFO L276 IsEmpty]: Start isEmpty. Operand 8864 states and 12998 transitions. [2024-10-12 21:33:46,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 21:33:46,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:33:46,468 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:33:46,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:33:46,468 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:33:46,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:33:46,469 INFO L85 PathProgramCache]: Analyzing trace with hash 443992391, now seen corresponding path program 1 times [2024-10-12 21:33:46,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:33:46,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105203313] [2024-10-12 21:33:46,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:33:46,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:33:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:33:46,591 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 21:33:46,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:33:46,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105203313] [2024-10-12 21:33:46,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105203313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:33:46,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:33:46,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:33:46,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173183937] [2024-10-12 21:33:46,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:33:46,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:33:46,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:33:46,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:33:46,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:33:46,593 INFO L87 Difference]: Start difference. First operand 8864 states and 12998 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 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 21:33:47,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:33:47,296 INFO L93 Difference]: Finished difference Result 49582 states and 72109 transitions. [2024-10-12 21:33:47,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 21:33:47,296 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 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 86 [2024-10-12 21:33:47,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:33:47,362 INFO L225 Difference]: With dead ends: 49582 [2024-10-12 21:33:47,363 INFO L226 Difference]: Without dead ends: 43020 [2024-10-12 21:33:47,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-12 21:33:47,378 INFO L432 NwaCegarLoop]: 1634 mSDtfsCounter, 8086 mSDsluCounter, 2232 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8086 SdHoareTripleChecker+Valid, 3866 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:33:47,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8086 Valid, 3866 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:33:47,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43020 states. [2024-10-12 21:33:47,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43020 to 15424. [2024-10-12 21:33:47,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15424 states, 15422 states have (on average 1.454934509142783) internal successors, (22438), 15423 states have internal predecessors, (22438), 0 states have call successors, (0), 0 states 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 21:33:47,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15424 states to 15424 states and 22438 transitions. [2024-10-12 21:33:47,951 INFO L78 Accepts]: Start accepts. Automaton has 15424 states and 22438 transitions. Word has length 86 [2024-10-12 21:33:47,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:33:47,952 INFO L471 AbstractCegarLoop]: Abstraction has 15424 states and 22438 transitions. [2024-10-12 21:33:47,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 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 21:33:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 15424 states and 22438 transitions. [2024-10-12 21:33:47,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 21:33:47,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:33:47,954 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:33:47,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:33:47,954 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:33:47,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:33:47,955 INFO L85 PathProgramCache]: Analyzing trace with hash 483936327, now seen corresponding path program 1 times [2024-10-12 21:33:47,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:33:47,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060570503] [2024-10-12 21:33:47,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:33:47,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:33:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:33:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 21:33:48,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:33:48,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060570503] [2024-10-12 21:33:48,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060570503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:33:48,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:33:48,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:33:48,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271358220] [2024-10-12 21:33:48,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:33:48,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:33:48,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:33:48,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:33:48,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:33:48,089 INFO L87 Difference]: Start difference. First operand 15424 states and 22438 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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 21:33:48,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:33:48,853 INFO L93 Difference]: Finished difference Result 56142 states and 81549 transitions. [2024-10-12 21:33:48,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 21:33:48,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 86 [2024-10-12 21:33:48,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:33:48,929 INFO L225 Difference]: With dead ends: 56142 [2024-10-12 21:33:48,930 INFO L226 Difference]: Without dead ends: 49580 [2024-10-12 21:33:48,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-12 21:33:48,950 INFO L432 NwaCegarLoop]: 1631 mSDtfsCounter, 8138 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8138 SdHoareTripleChecker+Valid, 3766 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:33:48,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8138 Valid, 3766 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:33:48,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49580 states. [2024-10-12 21:33:49,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49580 to 25280. [2024-10-12 21:33:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25280 states, 25278 states have (on average 1.4446554316006013) internal successors, (36518), 25279 states have internal predecessors, (36518), 0 states have call successors, (0), 0 states 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 21:33:49,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25280 states to 25280 states and 36518 transitions. [2024-10-12 21:33:49,652 INFO L78 Accepts]: Start accepts. Automaton has 25280 states and 36518 transitions. Word has length 86 [2024-10-12 21:33:49,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:33:49,653 INFO L471 AbstractCegarLoop]: Abstraction has 25280 states and 36518 transitions. [2024-10-12 21:33:49,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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 21:33:49,653 INFO L276 IsEmpty]: Start isEmpty. Operand 25280 states and 36518 transitions. [2024-10-12 21:33:49,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 21:33:49,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:33:49,657 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:33:49,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:33:49,657 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:33:49,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:33:49,657 INFO L85 PathProgramCache]: Analyzing trace with hash -141719737, now seen corresponding path program 1 times [2024-10-12 21:33:49,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:33:49,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161870174] [2024-10-12 21:33:49,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:33:49,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:33:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:33:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 21:33:49,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:33:49,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161870174] [2024-10-12 21:33:49,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161870174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:33:49,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:33:49,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:33:49,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109509575] [2024-10-12 21:33:49,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:33:49,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:33:49,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:33:49,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:33:49,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:33:49,796 INFO L87 Difference]: Start difference. First operand 25280 states and 36518 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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 21:33:50,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:33:50,604 INFO L93 Difference]: Finished difference Result 62702 states and 90989 transitions. [2024-10-12 21:33:50,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 21:33:50,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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 86 [2024-10-12 21:33:50,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:33:50,680 INFO L225 Difference]: With dead ends: 62702 [2024-10-12 21:33:50,680 INFO L226 Difference]: Without dead ends: 56140 [2024-10-12 21:33:50,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-12 21:33:50,695 INFO L432 NwaCegarLoop]: 1628 mSDtfsCounter, 8187 mSDsluCounter, 2140 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8187 SdHoareTripleChecker+Valid, 3768 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:33:50,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8187 Valid, 3768 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:33:50,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56140 states. [2024-10-12 21:33:51,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56140 to 31840. [2024-10-12 21:33:51,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31840 states, 31838 states have (on average 1.4434951944217602) internal successors, (45958), 31839 states have internal predecessors, (45958), 0 states have call successors, (0), 0 states 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 21:33:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31840 states to 31840 states and 45958 transitions. [2024-10-12 21:33:51,635 INFO L78 Accepts]: Start accepts. Automaton has 31840 states and 45958 transitions. Word has length 86 [2024-10-12 21:33:51,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:33:51,635 INFO L471 AbstractCegarLoop]: Abstraction has 31840 states and 45958 transitions. [2024-10-12 21:33:51,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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 21:33:51,636 INFO L276 IsEmpty]: Start isEmpty. Operand 31840 states and 45958 transitions. [2024-10-12 21:33:51,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 21:33:51,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:33:51,638 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:33:51,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:33:51,638 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:33:51,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:33:51,639 INFO L85 PathProgramCache]: Analyzing trace with hash 747013703, now seen corresponding path program 1 times [2024-10-12 21:33:51,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:33:51,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019493542] [2024-10-12 21:33:51,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:33:51,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:33:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:33:51,796 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 21:33:51,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:33:51,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019493542] [2024-10-12 21:33:51,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019493542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:33:51,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:33:51,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:33:51,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485148563] [2024-10-12 21:33:51,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:33:51,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:33:51,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:33:51,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:33:51,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:33:51,798 INFO L87 Difference]: Start difference. First operand 31840 states and 45958 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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 21:33:52,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:33:52,996 INFO L93 Difference]: Finished difference Result 69262 states and 100429 transitions. [2024-10-12 21:33:52,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 21:33:53,000 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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 86 [2024-10-12 21:33:53,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:33:53,093 INFO L225 Difference]: With dead ends: 69262 [2024-10-12 21:33:53,093 INFO L226 Difference]: Without dead ends: 62700 [2024-10-12 21:33:53,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-12 21:33:53,117 INFO L432 NwaCegarLoop]: 1633 mSDtfsCounter, 8094 mSDsluCounter, 2220 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8094 SdHoareTripleChecker+Valid, 3853 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:33:53,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8094 Valid, 3853 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:33:53,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62700 states. [2024-10-12 21:33:54,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62700 to 38400. [2024-10-12 21:33:54,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38400 states, 38398 states have (on average 1.4427313922600136) internal successors, (55398), 38399 states have internal predecessors, (55398), 0 states have call successors, (0), 0 states 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 21:33:54,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38400 states to 38400 states and 55398 transitions. [2024-10-12 21:33:54,440 INFO L78 Accepts]: Start accepts. Automaton has 38400 states and 55398 transitions. Word has length 86 [2024-10-12 21:33:54,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:33:54,441 INFO L471 AbstractCegarLoop]: Abstraction has 38400 states and 55398 transitions. [2024-10-12 21:33:54,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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 21:33:54,442 INFO L276 IsEmpty]: Start isEmpty. Operand 38400 states and 55398 transitions. [2024-10-12 21:33:54,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 21:33:54,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:33:54,449 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:33:54,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:33:54,449 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:33:54,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:33:54,449 INFO L85 PathProgramCache]: Analyzing trace with hash 712575559, now seen corresponding path program 1 times [2024-10-12 21:33:54,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:33:54,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337643293] [2024-10-12 21:33:54,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:33:54,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:33:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:33:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 21:33:54,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:33:54,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337643293] [2024-10-12 21:33:54,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337643293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:33:54,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:33:54,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:33:54,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047260903] [2024-10-12 21:33:54,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:33:54,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:33:54,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:33:54,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:33:54,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:33:54,609 INFO L87 Difference]: Start difference. First operand 38400 states and 55398 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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 21:33:56,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:33:56,114 INFO L93 Difference]: Finished difference Result 75822 states and 109869 transitions. [2024-10-12 21:33:56,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 21:33:56,114 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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 86 [2024-10-12 21:33:56,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:33:56,204 INFO L225 Difference]: With dead ends: 75822 [2024-10-12 21:33:56,204 INFO L226 Difference]: Without dead ends: 69260 [2024-10-12 21:33:56,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-12 21:33:56,222 INFO L432 NwaCegarLoop]: 1634 mSDtfsCounter, 8026 mSDsluCounter, 2398 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8026 SdHoareTripleChecker+Valid, 4032 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:33:56,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8026 Valid, 4032 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:33:56,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69260 states. [2024-10-12 21:33:57,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69260 to 44960. [2024-10-12 21:33:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44960 states, 44958 states have (on average 1.4421904889007517) internal successors, (64838), 44959 states have internal predecessors, (64838), 0 states have call successors, (0), 0 states 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 21:33:57,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44960 states to 44960 states and 64838 transitions. [2024-10-12 21:33:57,562 INFO L78 Accepts]: Start accepts. Automaton has 44960 states and 64838 transitions. Word has length 86 [2024-10-12 21:33:57,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:33:57,562 INFO L471 AbstractCegarLoop]: Abstraction has 44960 states and 64838 transitions. [2024-10-12 21:33:57,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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 21:33:57,562 INFO L276 IsEmpty]: Start isEmpty. Operand 44960 states and 64838 transitions. [2024-10-12 21:33:57,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-12 21:33:57,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:33:57,567 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:33:57,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:33:57,567 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:33:57,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:33:57,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1343316655, now seen corresponding path program 1 times [2024-10-12 21:33:57,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:33:57,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637741066] [2024-10-12 21:33:57,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:33:57,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:33:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:33:57,664 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:33:57,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:33:57,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637741066] [2024-10-12 21:33:57,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637741066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:33:57,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:33:57,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:33:57,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157133266] [2024-10-12 21:33:57,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:33:57,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:33:57,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:33:57,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:33:57,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:33:57,665 INFO L87 Difference]: Start difference. First operand 44960 states and 64838 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 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 21:33:58,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:33:58,317 INFO L93 Difference]: Finished difference Result 74937 states and 108542 transitions. [2024-10-12 21:33:58,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:33:58,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 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 21:33:58,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:33:58,359 INFO L225 Difference]: With dead ends: 74937 [2024-10-12 21:33:58,360 INFO L226 Difference]: Without dead ends: 32279 [2024-10-12 21:33:58,393 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 21:33:58,394 INFO L432 NwaCegarLoop]: 1607 mSDtfsCounter, 58 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3152 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:33:58,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3152 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:33:58,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32279 states. [2024-10-12 21:33:59,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32279 to 32277. [2024-10-12 21:33:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32277 states, 32275 states have (on average 1.4483965917893107) internal successors, (46747), 32276 states have internal predecessors, (46747), 0 states have call successors, (0), 0 states 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 21:33:59,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32277 states to 32277 states and 46747 transitions. [2024-10-12 21:33:59,452 INFO L78 Accepts]: Start accepts. Automaton has 32277 states and 46747 transitions. Word has length 88 [2024-10-12 21:33:59,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:33:59,453 INFO L471 AbstractCegarLoop]: Abstraction has 32277 states and 46747 transitions. [2024-10-12 21:33:59,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 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 21:33:59,453 INFO L276 IsEmpty]: Start isEmpty. Operand 32277 states and 46747 transitions. [2024-10-12 21:33:59,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-12 21:33:59,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:33:59,456 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:33:59,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 21:33:59,456 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:33:59,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:33:59,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2082755052, now seen corresponding path program 1 times [2024-10-12 21:33:59,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:33:59,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895506600] [2024-10-12 21:33:59,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:33:59,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:33:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:33:59,614 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:33:59,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:33:59,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895506600] [2024-10-12 21:33:59,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895506600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:33:59,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:33:59,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:33:59,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974835195] [2024-10-12 21:33:59,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:33:59,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:33:59,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:33:59,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:33:59,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:33:59,616 INFO L87 Difference]: Start difference. First operand 32277 states and 46747 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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 21:34:00,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:34:00,820 INFO L93 Difference]: Finished difference Result 59939 states and 87074 transitions. [2024-10-12 21:34:00,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 21:34:00,821 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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 88 [2024-10-12 21:34:00,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:34:00,880 INFO L225 Difference]: With dead ends: 59939 [2024-10-12 21:34:00,881 INFO L226 Difference]: Without dead ends: 55329 [2024-10-12 21:34:00,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-12 21:34:00,890 INFO L432 NwaCegarLoop]: 1625 mSDtfsCounter, 8038 mSDsluCounter, 2341 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8038 SdHoareTripleChecker+Valid, 3966 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:34:00,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8038 Valid, 3966 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:34:00,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55329 states. [2024-10-12 21:34:01,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55329 to 36885. [2024-10-12 21:34:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36885 states, 36883 states have (on average 1.4479028278610742) internal successors, (53403), 36884 states have internal predecessors, (53403), 0 states have call successors, (0), 0 states 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 21:34:01,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36885 states to 36885 states and 53403 transitions. [2024-10-12 21:34:01,862 INFO L78 Accepts]: Start accepts. Automaton has 36885 states and 53403 transitions. Word has length 88 [2024-10-12 21:34:01,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:34:01,862 INFO L471 AbstractCegarLoop]: Abstraction has 36885 states and 53403 transitions. [2024-10-12 21:34:01,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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 21:34:01,863 INFO L276 IsEmpty]: Start isEmpty. Operand 36885 states and 53403 transitions. [2024-10-12 21:34:01,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 21:34:01,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:34:01,865 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:34:01,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 21:34:01,865 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:34:01,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:34:01,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1555080975, now seen corresponding path program 1 times [2024-10-12 21:34:01,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:34:01,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417179807] [2024-10-12 21:34:01,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:34:01,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:34:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:34:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:34:01,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:34:01,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417179807] [2024-10-12 21:34:01,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417179807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:34:01,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:34:01,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:34:01,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067467006] [2024-10-12 21:34:01,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:34:01,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:34:01,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:34:01,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:34:01,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:34:01,937 INFO L87 Difference]: Start difference. First operand 36885 states and 53403 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 21:34:02,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:34:02,249 INFO L93 Difference]: Finished difference Result 54169 states and 78365 transitions. [2024-10-12 21:34:02,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:34:02,249 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 21:34:02,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:34:02,271 INFO L225 Difference]: With dead ends: 54169 [2024-10-12 21:34:02,272 INFO L226 Difference]: Without dead ends: 19607 [2024-10-12 21:34:02,292 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 21:34:02,293 INFO L432 NwaCegarLoop]: 1600 mSDtfsCounter, 53 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3137 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:34:02,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3137 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:34:02,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19607 states. [2024-10-12 21:34:02,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19607 to 19605. [2024-10-12 21:34:02,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19605 states, 19603 states have (on average 1.4387083609651583) internal successors, (28203), 19604 states have internal predecessors, (28203), 0 states have call successors, (0), 0 states 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 21:34:02,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19605 states to 19605 states and 28203 transitions. [2024-10-12 21:34:02,889 INFO L78 Accepts]: Start accepts. Automaton has 19605 states and 28203 transitions. Word has length 89 [2024-10-12 21:34:02,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:34:02,889 INFO L471 AbstractCegarLoop]: Abstraction has 19605 states and 28203 transitions. [2024-10-12 21:34:02,890 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 21:34:02,890 INFO L276 IsEmpty]: Start isEmpty. Operand 19605 states and 28203 transitions. [2024-10-12 21:34:02,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 21:34:02,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:34:02,892 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:34:02,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 21:34:02,892 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:34:02,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:34:02,893 INFO L85 PathProgramCache]: Analyzing trace with hash 433774111, now seen corresponding path program 1 times [2024-10-12 21:34:02,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:34:02,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840879793] [2024-10-12 21:34:02,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:34:02,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:34:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:34:02,977 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:34:02,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:34:02,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840879793] [2024-10-12 21:34:02,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840879793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:34:02,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:34:02,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:34:02,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040301988] [2024-10-12 21:34:02,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:34:02,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:34:02,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:34:02,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:34:02,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:34:02,979 INFO L87 Difference]: Start difference. First operand 19605 states and 28203 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 21:34:03,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:34:03,233 INFO L93 Difference]: Finished difference Result 28249 states and 40565 transitions. [2024-10-12 21:34:03,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:34:03,234 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 21:34:03,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:34:03,247 INFO L225 Difference]: With dead ends: 28249 [2024-10-12 21:34:03,247 INFO L226 Difference]: Without dead ends: 10967 [2024-10-12 21:34:03,258 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 21:34:03,259 INFO L432 NwaCegarLoop]: 1593 mSDtfsCounter, 50 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3122 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:34:03,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3122 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:34:03,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10967 states. [2024-10-12 21:34:03,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10967 to 10965. [2024-10-12 21:34:03,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10965 states, 10963 states have (on average 1.4341877223387758) internal successors, (15723), 10964 states have internal predecessors, (15723), 0 states have call successors, (0), 0 states 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 21:34:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10965 states to 10965 states and 15723 transitions. [2024-10-12 21:34:03,547 INFO L78 Accepts]: Start accepts. Automaton has 10965 states and 15723 transitions. Word has length 91 [2024-10-12 21:34:03,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:34:03,547 INFO L471 AbstractCegarLoop]: Abstraction has 10965 states and 15723 transitions. [2024-10-12 21:34:03,547 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 21:34:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 10965 states and 15723 transitions. [2024-10-12 21:34:03,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 21:34:03,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:34:03,549 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:34:03,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 21:34:03,549 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:34:03,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:34:03,550 INFO L85 PathProgramCache]: Analyzing trace with hash 475149517, now seen corresponding path program 1 times [2024-10-12 21:34:03,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:34:03,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218272228] [2024-10-12 21:34:03,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:34:03,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:34:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:34:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:34:03,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:34:03,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218272228] [2024-10-12 21:34:03,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218272228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:34:03,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:34:03,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:34:03,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008266672] [2024-10-12 21:34:03,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:34:03,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:34:03,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:34:03,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:34:03,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:34:03,621 INFO L87 Difference]: Start difference. First operand 10965 states and 15723 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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 21:34:03,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:34:03,712 INFO L93 Difference]: Finished difference Result 15289 states and 21845 transitions. [2024-10-12 21:34:03,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:34:03,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-10-12 21:34:03,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:34:03,719 INFO L225 Difference]: With dead ends: 15289 [2024-10-12 21:34:03,719 INFO L226 Difference]: Without dead ends: 6647 [2024-10-12 21:34:03,723 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 21:34:03,724 INFO L432 NwaCegarLoop]: 1586 mSDtfsCounter, 47 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3107 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:34:03,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3107 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:34:03,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6647 states. [2024-10-12 21:34:03,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6647 to 6645. [2024-10-12 21:34:03,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6645 states, 6643 states have (on average 1.4365497516182448) internal successors, (9543), 6644 states have internal predecessors, (9543), 0 states have call successors, (0), 0 states 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 21:34:03,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6645 states to 6645 states and 9543 transitions. [2024-10-12 21:34:03,880 INFO L78 Accepts]: Start accepts. Automaton has 6645 states and 9543 transitions. Word has length 93 [2024-10-12 21:34:03,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:34:03,881 INFO L471 AbstractCegarLoop]: Abstraction has 6645 states and 9543 transitions. [2024-10-12 21:34:03,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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 21:34:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand 6645 states and 9543 transitions. [2024-10-12 21:34:03,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 21:34:03,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:34:03,883 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] [2024-10-12 21:34:03,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 21:34:03,883 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:34:03,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:34:03,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1948500741, now seen corresponding path program 1 times [2024-10-12 21:34:03,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:34:03,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207157871] [2024-10-12 21:34:03,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:34:03,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:34:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:34:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:34:04,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:34:04,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207157871] [2024-10-12 21:34:04,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207157871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:34:04,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:34:04,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:34:04,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490424672] [2024-10-12 21:34:04,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:34:04,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:34:04,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:34:04,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:34:04,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:34:04,016 INFO L87 Difference]: Start difference. First operand 6645 states and 9543 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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 21:34:04,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:34:04,108 INFO L93 Difference]: Finished difference Result 8809 states and 12575 transitions. [2024-10-12 21:34:04,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:34:04,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-12 21:34:04,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:34:04,116 INFO L225 Difference]: With dead ends: 8809 [2024-10-12 21:34:04,116 INFO L226 Difference]: Without dead ends: 4487 [2024-10-12 21:34:04,119 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 21:34:04,121 INFO L432 NwaCegarLoop]: 1579 mSDtfsCounter, 44 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 3092 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:34:04,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 3092 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:34:04,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2024-10-12 21:34:04,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 4485. [2024-10-12 21:34:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4485 states, 4483 states have (on average 1.4461298237787197) internal successors, (6483), 4484 states have internal predecessors, (6483), 0 states have call successors, (0), 0 states 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 21:34:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4485 states to 4485 states and 6483 transitions. [2024-10-12 21:34:04,224 INFO L78 Accepts]: Start accepts. Automaton has 4485 states and 6483 transitions. Word has length 95 [2024-10-12 21:34:04,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:34:04,225 INFO L471 AbstractCegarLoop]: Abstraction has 4485 states and 6483 transitions. [2024-10-12 21:34:04,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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 21:34:04,225 INFO L276 IsEmpty]: Start isEmpty. Operand 4485 states and 6483 transitions. [2024-10-12 21:34:04,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-12 21:34:04,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:34:04,226 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:34:04,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 21:34:04,227 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:34:04,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:34:04,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1337448105, now seen corresponding path program 1 times [2024-10-12 21:34:04,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:34:04,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765353162] [2024-10-12 21:34:04,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:34:04,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:34:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:34:04,346 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:34:04,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:34:04,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765353162] [2024-10-12 21:34:04,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765353162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:34:04,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:34:04,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:34:04,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251277767] [2024-10-12 21:34:04,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:34:04,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:34:04,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:34:04,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:34:04,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:34:04,348 INFO L87 Difference]: Start difference. First operand 4485 states and 6483 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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 21:34:04,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:34:04,407 INFO L93 Difference]: Finished difference Result 5569 states and 7985 transitions. [2024-10-12 21:34:04,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:34:04,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-10-12 21:34:04,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:34:04,413 INFO L225 Difference]: With dead ends: 5569 [2024-10-12 21:34:04,413 INFO L226 Difference]: Without dead ends: 3407 [2024-10-12 21:34:04,415 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 21:34:04,416 INFO L432 NwaCegarLoop]: 1572 mSDtfsCounter, 41 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3077 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:34:04,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3077 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:34:04,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3407 states. [2024-10-12 21:34:04,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3407 to 3405. [2024-10-12 21:34:04,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3405 states, 3403 states have (on average 1.4598883338230972) internal successors, (4968), 3404 states have internal predecessors, (4968), 0 states have call successors, (0), 0 states 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 21:34:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 4968 transitions. [2024-10-12 21:34:04,482 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 4968 transitions. Word has length 97 [2024-10-12 21:34:04,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:34:04,483 INFO L471 AbstractCegarLoop]: Abstraction has 3405 states and 4968 transitions. [2024-10-12 21:34:04,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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 21:34:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 4968 transitions. [2024-10-12 21:34:04,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 21:34:04,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:34:04,484 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] [2024-10-12 21:34:04,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 21:34:04,485 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:34:04,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:34:04,485 INFO L85 PathProgramCache]: Analyzing trace with hash 54256087, now seen corresponding path program 1 times [2024-10-12 21:34:04,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:34:04,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924538885] [2024-10-12 21:34:04,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:34:04,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:34:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:34:04,936 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:34:04,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:34:04,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924538885] [2024-10-12 21:34:04,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924538885] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:34:04,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554743584] [2024-10-12 21:34:04,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:34:04,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:34:04,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:34:04,942 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 21:34:04,946 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 21:34:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:34:05,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 21:34:05,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:34:05,576 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:34:05,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:34:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:34:06,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554743584] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:34:06,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:34:06,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-10-12 21:34:06,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086486390] [2024-10-12 21:34:06,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:34:06,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-12 21:34:06,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:34:06,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-12 21:34:06,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2024-10-12 21:34:06,490 INFO L87 Difference]: Start difference. First operand 3405 states and 4968 transitions. Second operand has 25 states, 25 states have (on average 10.48) internal successors, (262), 24 states have internal predecessors, (262), 0 states have call successors, (0), 0 states 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 21:34:08,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:34:08,030 INFO L93 Difference]: Finished difference Result 7919 states and 11185 transitions. [2024-10-12 21:34:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-12 21:34:08,031 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.48) internal successors, (262), 24 states have internal predecessors, (262), 0 states have call successors, (0), 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 99 [2024-10-12 21:34:08,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:34:08,039 INFO L225 Difference]: With dead ends: 7919 [2024-10-12 21:34:08,040 INFO L226 Difference]: Without dead ends: 6837 [2024-10-12 21:34:08,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=629, Invalid=2233, Unknown=0, NotChecked=0, Total=2862 [2024-10-12 21:34:08,044 INFO L432 NwaCegarLoop]: 1506 mSDtfsCounter, 21213 mSDsluCounter, 5022 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21213 SdHoareTripleChecker+Valid, 6528 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:34:08,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21213 Valid, 6528 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:34:08,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6837 states. [2024-10-12 21:34:08,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6837 to 6765. [2024-10-12 21:34:08,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6765 states, 6763 states have (on average 1.4021883779387845) internal successors, (9483), 6764 states have internal predecessors, (9483), 0 states have call successors, (0), 0 states 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 21:34:08,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6765 states to 6765 states and 9483 transitions. [2024-10-12 21:34:08,178 INFO L78 Accepts]: Start accepts. Automaton has 6765 states and 9483 transitions. Word has length 99 [2024-10-12 21:34:08,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:34:08,178 INFO L471 AbstractCegarLoop]: Abstraction has 6765 states and 9483 transitions. [2024-10-12 21:34:08,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.48) internal successors, (262), 24 states have internal predecessors, (262), 0 states have call successors, (0), 0 states 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 21:34:08,178 INFO L276 IsEmpty]: Start isEmpty. Operand 6765 states and 9483 transitions. [2024-10-12 21:34:08,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 21:34:08,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:34:08,180 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:34:08,197 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 21:34:08,381 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,SelfDestructingSolverStorable25 [2024-10-12 21:34:08,381 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:34:08,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:34:08,382 INFO L85 PathProgramCache]: Analyzing trace with hash -256420804, now seen corresponding path program 1 times [2024-10-12 21:34:08,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:34:08,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666281551] [2024-10-12 21:34:08,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:34:08,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:34:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:34:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:34:09,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:34:09,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666281551] [2024-10-12 21:34:09,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666281551] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:34:09,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604804548] [2024-10-12 21:34:09,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:34:09,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:34:09,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:34:09,217 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 21:34:09,221 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 21:34:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:34:09,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-12 21:34:09,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:34:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:34:10,474 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:34:11,976 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:34:11,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604804548] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:34:11,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:34:11,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 14] total 40 [2024-10-12 21:34:11,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718223396] [2024-10-12 21:34:11,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:34:11,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-12 21:34:11,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:34:11,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-12 21:34:11,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1361, Unknown=0, NotChecked=0, Total=1560 [2024-10-12 21:34:11,979 INFO L87 Difference]: Start difference. First operand 6765 states and 9483 transitions. Second operand has 40 states, 40 states have (on average 6.75) internal successors, (270), 40 states have internal predecessors, (270), 0 states have call successors, (0), 0 states 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 21:34:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:34:16,994 INFO L93 Difference]: Finished difference Result 36309 states and 49485 transitions. [2024-10-12 21:34:16,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-10-12 21:34:16,994 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 6.75) internal successors, (270), 40 states have internal predecessors, (270), 0 states have call successors, (0), 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 100 [2024-10-12 21:34:16,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:34:17,028 INFO L225 Difference]: With dead ends: 36309 [2024-10-12 21:34:17,028 INFO L226 Difference]: Without dead ends: 31867 [2024-10-12 21:34:17,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2953 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1906, Invalid=8194, Unknown=0, NotChecked=0, Total=10100 [2024-10-12 21:34:17,042 INFO L432 NwaCegarLoop]: 1544 mSDtfsCounter, 24180 mSDsluCounter, 8707 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24180 SdHoareTripleChecker+Valid, 10251 SdHoareTripleChecker+Invalid, 2039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:34:17,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24180 Valid, 10251 Invalid, 2039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1954 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:34:17,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31867 states. [2024-10-12 21:34:17,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31867 to 31125. [2024-10-12 21:34:17,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31125 states, 31123 states have (on average 1.346688943867879) internal successors, (41913), 31124 states have internal predecessors, (41913), 0 states have call successors, (0), 0 states 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 21:34:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31125 states to 31125 states and 41913 transitions. [2024-10-12 21:34:17,850 INFO L78 Accepts]: Start accepts. Automaton has 31125 states and 41913 transitions. Word has length 100 [2024-10-12 21:34:17,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:34:17,851 INFO L471 AbstractCegarLoop]: Abstraction has 31125 states and 41913 transitions. [2024-10-12 21:34:17,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 6.75) internal successors, (270), 40 states have internal predecessors, (270), 0 states have call successors, (0), 0 states 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 21:34:17,851 INFO L276 IsEmpty]: Start isEmpty. Operand 31125 states and 41913 transitions. [2024-10-12 21:34:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 21:34:17,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:34:17,854 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:34:17,867 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 21:34:18,059 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,SelfDestructingSolverStorable26 [2024-10-12 21:34:18,059 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:34:18,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:34:18,059 INFO L85 PathProgramCache]: Analyzing trace with hash 387149573, now seen corresponding path program 1 times [2024-10-12 21:34:18,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:34:18,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762062297] [2024-10-12 21:34:18,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:34:18,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:34:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:34:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:34:18,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:34:18,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762062297] [2024-10-12 21:34:18,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762062297] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:34:18,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302690828] [2024-10-12 21:34:18,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:34:18,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:34:18,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:34:18,412 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:34:18,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 21:34:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:34:18,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-12 21:34:18,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:34:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:34:18,984 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:34:19,920 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:34:19,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302690828] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:34:19,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:34:19,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-10-12 21:34:19,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807644115] [2024-10-12 21:34:19,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:34:19,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-12 21:34:19,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:34:19,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-12 21:34:19,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2024-10-12 21:34:19,926 INFO L87 Difference]: Start difference. First operand 31125 states and 41913 transitions. Second operand has 23 states, 23 states have (on average 10.652173913043478) internal successors, (245), 22 states have internal predecessors, (245), 0 states have call successors, (0), 0 states 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 21:34:21,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:34:21,784 INFO L93 Difference]: Finished difference Result 91251 states and 122556 transitions. [2024-10-12 21:34:21,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 21:34:21,785 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 10.652173913043478) internal successors, (245), 22 states have internal predecessors, (245), 0 states have call successors, (0), 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 101 [2024-10-12 21:34:21,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:34:21,854 INFO L225 Difference]: With dead ends: 91251 [2024-10-12 21:34:21,854 INFO L226 Difference]: Without dead ends: 62449 [2024-10-12 21:34:21,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2024-10-12 21:34:21,883 INFO L432 NwaCegarLoop]: 1532 mSDtfsCounter, 13961 mSDsluCounter, 6387 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13961 SdHoareTripleChecker+Valid, 7919 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:34:21,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13961 Valid, 7919 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 21:34:21,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62449 states. [2024-10-12 21:34:23,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62449 to 61605. [2024-10-12 21:34:23,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61605 states, 61603 states have (on average 1.3246595133353896) internal successors, (81603), 61604 states have internal predecessors, (81603), 0 states have call successors, (0), 0 states 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 21:34:23,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61605 states to 61605 states and 81603 transitions. [2024-10-12 21:34:23,729 INFO L78 Accepts]: Start accepts. Automaton has 61605 states and 81603 transitions. Word has length 101 [2024-10-12 21:34:23,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:34:23,730 INFO L471 AbstractCegarLoop]: Abstraction has 61605 states and 81603 transitions. [2024-10-12 21:34:23,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.652173913043478) internal successors, (245), 22 states have internal predecessors, (245), 0 states have call successors, (0), 0 states 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 21:34:23,730 INFO L276 IsEmpty]: Start isEmpty. Operand 61605 states and 81603 transitions. [2024-10-12 21:34:23,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 21:34:23,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:34:23,734 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:34:23,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 21:34:23,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:34:23,934 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:34:23,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:34:23,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1493735660, now seen corresponding path program 1 times [2024-10-12 21:34:23,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:34:23,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35773849] [2024-10-12 21:34:23,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:34:23,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:34:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:34:24,204 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:34:24,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:34:24,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35773849] [2024-10-12 21:34:24,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35773849] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:34:24,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505376232] [2024-10-12 21:34:24,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:34:24,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:34:24,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:34:24,206 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:34:24,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 21:34:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:34:24,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-12 21:34:24,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:34:26,940 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 21:34:26,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:34:30,341 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 21:34:30,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505376232] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:34:30,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:34:30,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 21, 21] total 49 [2024-10-12 21:34:30,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713716578] [2024-10-12 21:34:30,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:34:30,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-12 21:34:30,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:34:30,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-12 21:34:30,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=2092, Unknown=0, NotChecked=0, Total=2450 [2024-10-12 21:34:30,344 INFO L87 Difference]: Start difference. First operand 61605 states and 81603 transitions. Second operand has 50 states, 50 states have (on average 5.56) internal successors, (278), 49 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)