./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.UNBOUNDED.pals.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 d52f31574095462f7bebf0d97516364dd650b64428a7b12e3aa21d1b47f96325 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:05:45,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:05:45,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:05:45,576 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:05:45,576 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:05:45,601 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:05:45,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:05:45,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:05:45,603 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:05:45,604 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:05:45,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:05:45,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:05:45,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:05:45,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:05:45,607 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:05:45,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:05:45,608 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:05:45,608 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:05:45,608 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:05:45,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:05:45,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:05:45,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:05:45,611 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:05:45,611 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:05:45,612 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:05:45,612 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:05:45,612 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:05:45,612 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:05:45,612 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:05:45,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:05:45,613 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:05:45,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:05:45,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:05:45,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:05:45,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:05:45,614 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:05:45,615 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:05:45,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:05:45,615 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:05:45,615 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:05:45,615 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:05:45,615 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:05:45,616 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 -> d52f31574095462f7bebf0d97516364dd650b64428a7b12e3aa21d1b47f96325 [2024-10-12 20:05:45,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:05:45,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:05:45,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:05:45,819 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:05:45,820 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:05:45,821 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.UNBOUNDED.pals.c [2024-10-12 20:05:47,032 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:05:47,202 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:05:47,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.UNBOUNDED.pals.c [2024-10-12 20:05:47,220 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30ec716a7/6abe98fa5c374a3b8642fbbf33b5e56f/FLAGcfd220a38 [2024-10-12 20:05:47,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30ec716a7/6abe98fa5c374a3b8642fbbf33b5e56f [2024-10-12 20:05:47,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:05:47,578 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:05:47,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:05:47,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:05:47,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:05:47,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:05:47" (1/1) ... [2024-10-12 20:05:47,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@729523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:47, skipping insertion in model container [2024-10-12 20:05:47,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:05:47" (1/1) ... [2024-10-12 20:05:47,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:05:47,861 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.UNBOUNDED.pals.c[20084,20097] [2024-10-12 20:05:47,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:05:47,875 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:05:47,930 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.UNBOUNDED.pals.c[20084,20097] [2024-10-12 20:05:47,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:05:47,950 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:05:47,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:47 WrapperNode [2024-10-12 20:05:47,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:05:47,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:05:47,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:05:47,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:05:47,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:47" (1/1) ... [2024-10-12 20:05:47,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:47" (1/1) ... [2024-10-12 20:05:47,999 INFO L138 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 459 [2024-10-12 20:05:48,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:05:48,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:05:48,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:05:48,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:05:48,011 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:47" (1/1) ... [2024-10-12 20:05:48,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:47" (1/1) ... [2024-10-12 20:05:48,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:47" (1/1) ... [2024-10-12 20:05:48,030 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 20:05:48,030 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:47" (1/1) ... [2024-10-12 20:05:48,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:47" (1/1) ... [2024-10-12 20:05:48,042 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:47" (1/1) ... [2024-10-12 20:05:48,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:47" (1/1) ... [2024-10-12 20:05:48,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:47" (1/1) ... [2024-10-12 20:05:48,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:47" (1/1) ... [2024-10-12 20:05:48,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:05:48,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:05:48,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:05:48,052 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:05:48,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:47" (1/1) ... [2024-10-12 20:05:48,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:05:48,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:05:48,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:05:48,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:05:48,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:05:48,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:05:48,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:05:48,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:05:48,203 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:05:48,205 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:05:48,621 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2024-10-12 20:05:48,623 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:05:48,668 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:05:48,670 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 20:05:48,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:05:48 BoogieIcfgContainer [2024-10-12 20:05:48,670 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:05:48,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:05:48,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:05:48,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:05:48,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:05:47" (1/3) ... [2024-10-12 20:05:48,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f96e13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:05:48, skipping insertion in model container [2024-10-12 20:05:48,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:47" (2/3) ... [2024-10-12 20:05:48,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f96e13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:05:48, skipping insertion in model container [2024-10-12 20:05:48,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:05:48" (3/3) ... [2024-10-12 20:05:48,676 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c [2024-10-12 20:05:48,686 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:05:48,687 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:05:48,737 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:05:48,743 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;@1e357369, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:05:48,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:05:48,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 109 states have (on average 1.81651376146789) internal successors, (198), 110 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:48,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 20:05:48,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:48,757 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] [2024-10-12 20:05:48,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:48,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:48,761 INFO L85 PathProgramCache]: Analyzing trace with hash -697384584, now seen corresponding path program 1 times [2024-10-12 20:05:48,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:48,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125991806] [2024-10-12 20:05:48,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:48,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:49,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:49,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:49,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125991806] [2024-10-12 20:05:49,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125991806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:49,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:49,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 20:05:49,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754221221] [2024-10-12 20:05:49,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:49,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 20:05:49,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:49,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 20:05:49,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 20:05:49,071 INFO L87 Difference]: Start difference. First operand has 111 states, 109 states have (on average 1.81651376146789) internal successors, (198), 110 states have internal predecessors, (198), 0 states have call successors, (0), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:49,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:49,102 INFO L93 Difference]: Finished difference Result 167 states and 291 transitions. [2024-10-12 20:05:49,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 20:05:49,105 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-10-12 20:05:49,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:49,112 INFO L225 Difference]: With dead ends: 167 [2024-10-12 20:05:49,113 INFO L226 Difference]: Without dead ends: 109 [2024-10-12 20:05:49,115 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 20:05:49,119 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:49,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:49,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-12 20:05:49,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-12 20:05:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.787037037037037) internal successors, (193), 108 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:49,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 193 transitions. [2024-10-12 20:05:49,152 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 193 transitions. Word has length 24 [2024-10-12 20:05:49,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:49,153 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 193 transitions. [2024-10-12 20:05:49,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:49,153 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 193 transitions. [2024-10-12 20:05:49,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 20:05:49,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:49,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:49,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:05:49,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:49,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:49,156 INFO L85 PathProgramCache]: Analyzing trace with hash -274682758, now seen corresponding path program 1 times [2024-10-12 20:05:49,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:49,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150490607] [2024-10-12 20:05:49,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:49,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:49,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:49,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:49,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150490607] [2024-10-12 20:05:49,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150490607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:49,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:49,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:05:49,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732553089] [2024-10-12 20:05:49,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:49,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:05:49,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:49,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:05:49,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:05:49,324 INFO L87 Difference]: Start difference. First operand 109 states and 193 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:49,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:49,415 INFO L93 Difference]: Finished difference Result 167 states and 285 transitions. [2024-10-12 20:05:49,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:05:49,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-10-12 20:05:49,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:49,417 INFO L225 Difference]: With dead ends: 167 [2024-10-12 20:05:49,417 INFO L226 Difference]: Without dead ends: 109 [2024-10-12 20:05:49,417 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 20:05:49,418 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 0 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:49,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 517 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:49,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-12 20:05:49,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-12 20:05:49,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.3240740740740742) internal successors, (143), 108 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2024-10-12 20:05:49,427 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 143 transitions. Word has length 24 [2024-10-12 20:05:49,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:49,427 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 143 transitions. [2024-10-12 20:05:49,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:49,427 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 143 transitions. [2024-10-12 20:05:49,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-12 20:05:49,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:49,429 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:49,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:05:49,429 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:49,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:49,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2067769244, now seen corresponding path program 1 times [2024-10-12 20:05:49,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:49,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612988402] [2024-10-12 20:05:49,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:49,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:49,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:49,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:49,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612988402] [2024-10-12 20:05:49,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612988402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:49,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:49,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:05:49,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452033973] [2024-10-12 20:05:49,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:49,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:05:49,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:49,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:05:49,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:05:49,722 INFO L87 Difference]: Start difference. First operand 109 states and 143 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:50,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:50,119 INFO L93 Difference]: Finished difference Result 879 states and 1389 transitions. [2024-10-12 20:05:50,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:05:50,120 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-12 20:05:50,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:50,125 INFO L225 Difference]: With dead ends: 879 [2024-10-12 20:05:50,126 INFO L226 Difference]: Without dead ends: 824 [2024-10-12 20:05:50,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2024-10-12 20:05:50,128 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 1593 mSDsluCounter, 2472 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1593 SdHoareTripleChecker+Valid, 2606 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:50,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1593 Valid, 2606 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:05:50,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2024-10-12 20:05:50,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 162. [2024-10-12 20:05:50,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.4223602484472049) internal successors, (229), 161 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:50,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 229 transitions. [2024-10-12 20:05:50,162 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 229 transitions. Word has length 73 [2024-10-12 20:05:50,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:50,164 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 229 transitions. [2024-10-12 20:05:50,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:50,164 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 229 transitions. [2024-10-12 20:05:50,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 20:05:50,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:50,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:50,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:05:50,167 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:50,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:50,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2090732908, now seen corresponding path program 1 times [2024-10-12 20:05:50,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:50,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744792627] [2024-10-12 20:05:50,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:50,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:50,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:50,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:50,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744792627] [2024-10-12 20:05:50,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744792627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:50,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:50,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:50,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776662458] [2024-10-12 20:05:50,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:50,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:50,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:50,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:50,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:50,303 INFO L87 Difference]: Start difference. First operand 162 states and 229 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:50,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:50,324 INFO L93 Difference]: Finished difference Result 367 states and 560 transitions. [2024-10-12 20:05:50,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:50,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-12 20:05:50,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:50,326 INFO L225 Difference]: With dead ends: 367 [2024-10-12 20:05:50,326 INFO L226 Difference]: Without dead ends: 259 [2024-10-12 20:05:50,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:50,327 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 60 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:50,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 217 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:50,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-12 20:05:50,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2024-10-12 20:05:50,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.484251968503937) internal successors, (377), 254 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:50,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 377 transitions. [2024-10-12 20:05:50,341 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 377 transitions. Word has length 75 [2024-10-12 20:05:50,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:50,341 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 377 transitions. [2024-10-12 20:05:50,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:50,341 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 377 transitions. [2024-10-12 20:05:50,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 20:05:50,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:50,348 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:50,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:05:50,348 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:50,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:50,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2092877860, now seen corresponding path program 1 times [2024-10-12 20:05:50,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:50,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491614401] [2024-10-12 20:05:50,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:50,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:50,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:50,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491614401] [2024-10-12 20:05:50,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491614401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:50,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:50,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:05:50,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116193467] [2024-10-12 20:05:50,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:50,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:05:50,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:50,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:05:50,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:05:50,726 INFO L87 Difference]: Start difference. First operand 255 states and 377 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:50,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:50,998 INFO L93 Difference]: Finished difference Result 458 states and 701 transitions. [2024-10-12 20:05:50,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:05:50,999 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-12 20:05:50,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:51,000 INFO L225 Difference]: With dead ends: 458 [2024-10-12 20:05:51,000 INFO L226 Difference]: Without dead ends: 257 [2024-10-12 20:05:51,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-10-12 20:05:51,002 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 308 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:51,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 641 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:51,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-10-12 20:05:51,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2024-10-12 20:05:51,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.4763779527559056) internal successors, (375), 254 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:51,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 375 transitions. [2024-10-12 20:05:51,008 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 375 transitions. Word has length 75 [2024-10-12 20:05:51,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:51,009 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 375 transitions. [2024-10-12 20:05:51,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:51,009 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 375 transitions. [2024-10-12 20:05:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 20:05:51,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:51,010 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:51,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:05:51,011 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:51,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:51,011 INFO L85 PathProgramCache]: Analyzing trace with hash 440631821, now seen corresponding path program 1 times [2024-10-12 20:05:51,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:51,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262073570] [2024-10-12 20:05:51,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:51,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:51,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:51,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262073570] [2024-10-12 20:05:51,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262073570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:51,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:51,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:05:51,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816616201] [2024-10-12 20:05:51,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:51,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:05:51,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:51,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:05:51,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:05:51,184 INFO L87 Difference]: Start difference. First operand 255 states and 375 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:51,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:51,201 INFO L93 Difference]: Finished difference Result 261 states and 382 transitions. [2024-10-12 20:05:51,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:05:51,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-12 20:05:51,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:51,203 INFO L225 Difference]: With dead ends: 261 [2024-10-12 20:05:51,203 INFO L226 Difference]: Without dead ends: 259 [2024-10-12 20:05:51,204 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 20:05:51,204 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 409 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 20:05:51,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 409 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:51,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-12 20:05:51,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2024-10-12 20:05:51,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 1.4651162790697674) internal successors, (378), 258 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 378 transitions. [2024-10-12 20:05:51,211 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 378 transitions. Word has length 76 [2024-10-12 20:05:51,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:51,212 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 378 transitions. [2024-10-12 20:05:51,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:51,212 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 378 transitions. [2024-10-12 20:05:51,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:05:51,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:51,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:51,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:05:51,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:51,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:51,213 INFO L85 PathProgramCache]: Analyzing trace with hash 226592356, now seen corresponding path program 1 times [2024-10-12 20:05:51,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:51,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032621457] [2024-10-12 20:05:51,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:51,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:51,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:51,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032621457] [2024-10-12 20:05:51,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032621457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:51,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:51,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:51,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581086822] [2024-10-12 20:05:51,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:51,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:51,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:51,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:51,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:51,268 INFO L87 Difference]: Start difference. First operand 259 states and 378 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:51,284 INFO L93 Difference]: Finished difference Result 653 states and 998 transitions. [2024-10-12 20:05:51,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:51,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-12 20:05:51,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:51,286 INFO L225 Difference]: With dead ends: 653 [2024-10-12 20:05:51,286 INFO L226 Difference]: Without dead ends: 448 [2024-10-12 20:05:51,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:51,288 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 77 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:51,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 298 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:51,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-10-12 20:05:51,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 446. [2024-10-12 20:05:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.503370786516854) internal successors, (669), 445 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:51,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 669 transitions. [2024-10-12 20:05:51,300 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 669 transitions. Word has length 77 [2024-10-12 20:05:51,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:51,301 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 669 transitions. [2024-10-12 20:05:51,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:51,301 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 669 transitions. [2024-10-12 20:05:51,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:05:51,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:51,303 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:51,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:05:51,304 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:51,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:51,305 INFO L85 PathProgramCache]: Analyzing trace with hash -452377500, now seen corresponding path program 1 times [2024-10-12 20:05:51,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:51,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344122777] [2024-10-12 20:05:51,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:51,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:51,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:51,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344122777] [2024-10-12 20:05:51,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344122777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:51,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:51,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:51,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211862639] [2024-10-12 20:05:51,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:51,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:51,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:51,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:51,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:51,353 INFO L87 Difference]: Start difference. First operand 446 states and 669 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:51,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:51,372 INFO L93 Difference]: Finished difference Result 1198 states and 1843 transitions. [2024-10-12 20:05:51,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:51,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-12 20:05:51,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:51,375 INFO L225 Difference]: With dead ends: 1198 [2024-10-12 20:05:51,375 INFO L226 Difference]: Without dead ends: 806 [2024-10-12 20:05:51,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:51,377 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 73 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:51,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 294 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:51,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-10-12 20:05:51,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 804. [2024-10-12 20:05:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 803 states have (on average 1.518057285180573) internal successors, (1219), 803 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1219 transitions. [2024-10-12 20:05:51,399 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1219 transitions. Word has length 77 [2024-10-12 20:05:51,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:51,399 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1219 transitions. [2024-10-12 20:05:51,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:51,399 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1219 transitions. [2024-10-12 20:05:51,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:05:51,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:51,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:51,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:05:51,402 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:51,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:51,402 INFO L85 PathProgramCache]: Analyzing trace with hash -412433564, now seen corresponding path program 1 times [2024-10-12 20:05:51,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:51,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906626645] [2024-10-12 20:05:51,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:51,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:51,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:51,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:51,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906626645] [2024-10-12 20:05:51,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906626645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:51,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:51,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:51,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699261319] [2024-10-12 20:05:51,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:51,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:51,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:51,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:51,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:51,464 INFO L87 Difference]: Start difference. First operand 804 states and 1219 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:51,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:51,495 INFO L93 Difference]: Finished difference Result 2240 states and 3437 transitions. [2024-10-12 20:05:51,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:51,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-12 20:05:51,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:51,500 INFO L225 Difference]: With dead ends: 2240 [2024-10-12 20:05:51,500 INFO L226 Difference]: Without dead ends: 1490 [2024-10-12 20:05:51,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:51,501 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 71 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:51,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 296 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:51,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2024-10-12 20:05:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1488. [2024-10-12 20:05:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1487 states have (on average 1.5164761264290518) internal successors, (2255), 1487 states have internal predecessors, (2255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:51,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 2255 transitions. [2024-10-12 20:05:51,536 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 2255 transitions. Word has length 77 [2024-10-12 20:05:51,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:51,537 INFO L471 AbstractCegarLoop]: Abstraction has 1488 states and 2255 transitions. [2024-10-12 20:05:51,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:51,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 2255 transitions. [2024-10-12 20:05:51,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:05:51,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:51,539 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:51,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:05:51,539 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:51,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:51,540 INFO L85 PathProgramCache]: Analyzing trace with hash -149356188, now seen corresponding path program 1 times [2024-10-12 20:05:51,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:51,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867956050] [2024-10-12 20:05:51,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:51,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:51,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:51,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867956050] [2024-10-12 20:05:51,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867956050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:51,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:51,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:51,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018889093] [2024-10-12 20:05:51,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:51,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:51,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:51,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:51,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:51,595 INFO L87 Difference]: Start difference. First operand 1488 states and 2255 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:51,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:51,636 INFO L93 Difference]: Finished difference Result 4228 states and 6433 transitions. [2024-10-12 20:05:51,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:51,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-12 20:05:51,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:51,643 INFO L225 Difference]: With dead ends: 4228 [2024-10-12 20:05:51,643 INFO L226 Difference]: Without dead ends: 2794 [2024-10-12 20:05:51,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:51,645 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 67 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:51,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 292 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:51,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2794 states. [2024-10-12 20:05:51,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2794 to 2792. [2024-10-12 20:05:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2792 states, 2791 states have (on average 1.5044786814761735) internal successors, (4199), 2791 states have internal predecessors, (4199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2792 states and 4199 transitions. [2024-10-12 20:05:51,692 INFO L78 Accepts]: Start accepts. Automaton has 2792 states and 4199 transitions. Word has length 77 [2024-10-12 20:05:51,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:51,692 INFO L471 AbstractCegarLoop]: Abstraction has 2792 states and 4199 transitions. [2024-10-12 20:05:51,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:51,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 4199 transitions. [2024-10-12 20:05:51,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:05:51,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:51,693 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:51,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:05:51,693 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:51,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:51,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1038089628, now seen corresponding path program 1 times [2024-10-12 20:05:51,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:51,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835760723] [2024-10-12 20:05:51,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:51,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:51,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:51,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835760723] [2024-10-12 20:05:51,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835760723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:51,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:51,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:51,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274194692] [2024-10-12 20:05:51,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:51,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:51,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:51,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:51,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:51,741 INFO L87 Difference]: Start difference. First operand 2792 states and 4199 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:51,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:51,827 INFO L93 Difference]: Finished difference Result 8012 states and 12041 transitions. [2024-10-12 20:05:51,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:51,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-12 20:05:51,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:51,842 INFO L225 Difference]: With dead ends: 8012 [2024-10-12 20:05:51,842 INFO L226 Difference]: Without dead ends: 5274 [2024-10-12 20:05:51,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:51,845 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 69 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:51,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 298 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:51,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5274 states. [2024-10-12 20:05:51,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5274 to 5272. [2024-10-12 20:05:51,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5272 states, 5271 states have (on average 1.4856763422500474) internal successors, (7831), 5271 states have internal predecessors, (7831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:51,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5272 states to 5272 states and 7831 transitions. [2024-10-12 20:05:51,952 INFO L78 Accepts]: Start accepts. Automaton has 5272 states and 7831 transitions. Word has length 77 [2024-10-12 20:05:51,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:51,952 INFO L471 AbstractCegarLoop]: Abstraction has 5272 states and 7831 transitions. [2024-10-12 20:05:51,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:51,952 INFO L276 IsEmpty]: Start isEmpty. Operand 5272 states and 7831 transitions. [2024-10-12 20:05:51,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:05:51,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:51,953 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:51,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:05:51,953 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:51,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:51,953 INFO L85 PathProgramCache]: Analyzing trace with hash -183794332, now seen corresponding path program 1 times [2024-10-12 20:05:51,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:51,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076187003] [2024-10-12 20:05:51,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:51,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:51,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:51,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076187003] [2024-10-12 20:05:51,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076187003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:51,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:51,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:51,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978771356] [2024-10-12 20:05:51,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:51,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:51,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:51,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:51,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:51,999 INFO L87 Difference]: Start difference. First operand 5272 states and 7831 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:52,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:52,163 INFO L93 Difference]: Finished difference Result 15196 states and 22489 transitions. [2024-10-12 20:05:52,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:52,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-12 20:05:52,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:52,186 INFO L225 Difference]: With dead ends: 15196 [2024-10-12 20:05:52,187 INFO L226 Difference]: Without dead ends: 9978 [2024-10-12 20:05:52,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:52,192 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 75 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:52,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 300 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:52,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9978 states. [2024-10-12 20:05:52,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9978 to 9976. [2024-10-12 20:05:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9976 states, 9975 states have (on average 1.461954887218045) internal successors, (14583), 9975 states have internal predecessors, (14583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9976 states to 9976 states and 14583 transitions. [2024-10-12 20:05:52,373 INFO L78 Accepts]: Start accepts. Automaton has 9976 states and 14583 transitions. Word has length 77 [2024-10-12 20:05:52,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:52,374 INFO L471 AbstractCegarLoop]: Abstraction has 9976 states and 14583 transitions. [2024-10-12 20:05:52,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:52,374 INFO L276 IsEmpty]: Start isEmpty. Operand 9976 states and 14583 transitions. [2024-10-12 20:05:52,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 20:05:52,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:52,375 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:52,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:05:52,375 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:52,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:52,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1082900329, now seen corresponding path program 1 times [2024-10-12 20:05:52,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:52,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620569851] [2024-10-12 20:05:52,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:52,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:52,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:52,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:52,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620569851] [2024-10-12 20:05:52,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620569851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:52,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:52,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:52,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282122989] [2024-10-12 20:05:52,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:52,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:52,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:52,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:52,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:52,437 INFO L87 Difference]: Start difference. First operand 9976 states and 14583 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 20:05:52,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:52,582 INFO L93 Difference]: Finished difference Result 20223 states and 29821 transitions. [2024-10-12 20:05:52,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:52,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 79 [2024-10-12 20:05:52,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:52,611 INFO L225 Difference]: With dead ends: 20223 [2024-10-12 20:05:52,612 INFO L226 Difference]: Without dead ends: 14716 [2024-10-12 20:05:52,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:52,621 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 76 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:52,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 299 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:52,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14716 states. [2024-10-12 20:05:52,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14716 to 14714. [2024-10-12 20:05:52,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14714 states, 14713 states have (on average 1.4567389383538367) internal successors, (21433), 14713 states have internal predecessors, (21433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:52,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14714 states to 14714 states and 21433 transitions. [2024-10-12 20:05:52,963 INFO L78 Accepts]: Start accepts. Automaton has 14714 states and 21433 transitions. Word has length 79 [2024-10-12 20:05:52,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:52,963 INFO L471 AbstractCegarLoop]: Abstraction has 14714 states and 21433 transitions. [2024-10-12 20:05:52,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 20:05:52,964 INFO L276 IsEmpty]: Start isEmpty. Operand 14714 states and 21433 transitions. [2024-10-12 20:05:52,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 20:05:52,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:52,967 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:52,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:05:52,967 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:52,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:52,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1694131117, now seen corresponding path program 1 times [2024-10-12 20:05:52,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:52,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868247370] [2024-10-12 20:05:52,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:52,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:53,190 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 20:05:53,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:53,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868247370] [2024-10-12 20:05:53,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868247370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:53,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:53,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:05:53,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773866960] [2024-10-12 20:05:53,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:53,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:05:53,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:53,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:05:53,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:05:53,192 INFO L87 Difference]: Start difference. First operand 14714 states and 21433 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:54,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:54,455 INFO L93 Difference]: Finished difference Result 120266 states and 175233 transitions. [2024-10-12 20:05:54,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:05:54,455 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 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 20:05:54,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:54,707 INFO L225 Difference]: With dead ends: 120266 [2024-10-12 20:05:54,707 INFO L226 Difference]: Without dead ends: 105608 [2024-10-12 20:05:54,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:05:54,746 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 1324 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1324 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:54,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1324 Valid, 1373 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:54,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105608 states. [2024-10-12 20:05:55,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105608 to 29370. [2024-10-12 20:05:55,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29370 states, 29369 states have (on average 1.4510878817801083) internal successors, (42617), 29369 states have internal predecessors, (42617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:55,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29370 states to 29370 states and 42617 transitions. [2024-10-12 20:05:55,932 INFO L78 Accepts]: Start accepts. Automaton has 29370 states and 42617 transitions. Word has length 99 [2024-10-12 20:05:55,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:55,932 INFO L471 AbstractCegarLoop]: Abstraction has 29370 states and 42617 transitions. [2024-10-12 20:05:55,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:55,933 INFO L276 IsEmpty]: Start isEmpty. Operand 29370 states and 42617 transitions. [2024-10-12 20:05:55,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 20:05:55,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:55,939 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:55,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:05:55,939 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:55,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:55,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1015161261, now seen corresponding path program 1 times [2024-10-12 20:05:55,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:55,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090161302] [2024-10-12 20:05:55,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:55,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:56,137 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 20:05:56,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:56,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090161302] [2024-10-12 20:05:56,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090161302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:56,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:56,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:05:56,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467275403] [2024-10-12 20:05:56,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:56,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:05:56,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:56,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:05:56,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:05:56,139 INFO L87 Difference]: Start difference. First operand 29370 states and 42617 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:57,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:57,726 INFO L93 Difference]: Finished difference Result 134922 states and 196417 transitions. [2024-10-12 20:05:57,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:05:57,726 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 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 20:05:57,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:57,870 INFO L225 Difference]: With dead ends: 134922 [2024-10-12 20:05:57,871 INFO L226 Difference]: Without dead ends: 120264 [2024-10-12 20:05:57,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:05:57,895 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 1370 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1370 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:57,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1370 Valid, 1336 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:57,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120264 states. [2024-10-12 20:05:59,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120264 to 51386. [2024-10-12 20:05:59,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51386 states, 51385 states have (on average 1.4446433784178263) internal successors, (74233), 51385 states have internal predecessors, (74233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:59,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51386 states to 51386 states and 74233 transitions. [2024-10-12 20:05:59,606 INFO L78 Accepts]: Start accepts. Automaton has 51386 states and 74233 transitions. Word has length 99 [2024-10-12 20:05:59,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:59,606 INFO L471 AbstractCegarLoop]: Abstraction has 51386 states and 74233 transitions. [2024-10-12 20:05:59,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:59,607 INFO L276 IsEmpty]: Start isEmpty. Operand 51386 states and 74233 transitions. [2024-10-12 20:05:59,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 20:05:59,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:59,611 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:59,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:05:59,611 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:59,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:59,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1055105197, now seen corresponding path program 1 times [2024-10-12 20:05:59,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:59,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972014111] [2024-10-12 20:05:59,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:59,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 20:05:59,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:59,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972014111] [2024-10-12 20:05:59,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972014111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:59,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:59,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:05:59,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597334064] [2024-10-12 20:05:59,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:59,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:05:59,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:59,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:05:59,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:05:59,758 INFO L87 Difference]: Start difference. First operand 51386 states and 74233 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:06:01,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:06:01,788 INFO L93 Difference]: Finished difference Result 149578 states and 217601 transitions. [2024-10-12 20:06:01,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:06:01,789 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 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 20:06:01,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:06:01,958 INFO L225 Difference]: With dead ends: 149578 [2024-10-12 20:06:01,959 INFO L226 Difference]: Without dead ends: 134920 [2024-10-12 20:06:01,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:06:01,993 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 1524 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:06:01,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1278 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:06:02,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134920 states. [2024-10-12 20:06:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134920 to 66042. [2024-10-12 20:06:03,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66042 states, 66041 states have (on average 1.4448145848790903) internal successors, (95417), 66041 states have internal predecessors, (95417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:06:03,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66042 states to 66042 states and 95417 transitions. [2024-10-12 20:06:03,966 INFO L78 Accepts]: Start accepts. Automaton has 66042 states and 95417 transitions. Word has length 99 [2024-10-12 20:06:03,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:06:03,967 INFO L471 AbstractCegarLoop]: Abstraction has 66042 states and 95417 transitions. [2024-10-12 20:06:03,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:06:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 66042 states and 95417 transitions. [2024-10-12 20:06:03,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 20:06:03,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:06:03,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:06:03,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:06:03,972 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:06:03,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:06:03,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1318182573, now seen corresponding path program 1 times [2024-10-12 20:06:03,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:06:03,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929199078] [2024-10-12 20:06:03,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:06:03,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:06:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:06:04,130 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 20:06:04,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:06:04,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929199078] [2024-10-12 20:06:04,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929199078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:06:04,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:06:04,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:06:04,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744456973] [2024-10-12 20:06:04,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:06:04,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:06:04,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:06:04,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:06:04,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:06:04,132 INFO L87 Difference]: Start difference. First operand 66042 states and 95417 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:06:06,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:06:06,717 INFO L93 Difference]: Finished difference Result 164234 states and 238785 transitions. [2024-10-12 20:06:06,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:06:06,718 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 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 20:06:06,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:06:06,888 INFO L225 Difference]: With dead ends: 164234 [2024-10-12 20:06:06,889 INFO L226 Difference]: Without dead ends: 149576 [2024-10-12 20:06:06,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:06:06,923 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 1422 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1422 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:06:06,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1422 Valid, 1326 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:06:06,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149576 states. [2024-10-12 20:06:08,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149576 to 80698. [2024-10-12 20:06:08,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80698 states, 80697 states have (on average 1.4449236031079222) internal successors, (116601), 80697 states have internal predecessors, (116601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:06:09,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80698 states to 80698 states and 116601 transitions. [2024-10-12 20:06:09,006 INFO L78 Accepts]: Start accepts. Automaton has 80698 states and 116601 transitions. Word has length 99 [2024-10-12 20:06:09,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:06:09,007 INFO L471 AbstractCegarLoop]: Abstraction has 80698 states and 116601 transitions. [2024-10-12 20:06:09,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:06:09,007 INFO L276 IsEmpty]: Start isEmpty. Operand 80698 states and 116601 transitions. [2024-10-12 20:06:09,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 20:06:09,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:06:09,011 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:06:09,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:06:09,011 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:06:09,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:06:09,012 INFO L85 PathProgramCache]: Analyzing trace with hash 429449133, now seen corresponding path program 1 times [2024-10-12 20:06:09,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:06:09,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793169923] [2024-10-12 20:06:09,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:06:09,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:06:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:06:09,343 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 20:06:09,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:06:09,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793169923] [2024-10-12 20:06:09,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793169923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:06:09,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:06:09,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:06:09,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549233834] [2024-10-12 20:06:09,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:06:09,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:06:09,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:06:09,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:06:09,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:06:09,345 INFO L87 Difference]: Start difference. First operand 80698 states and 116601 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:06:12,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:06:12,177 INFO L93 Difference]: Finished difference Result 178890 states and 259969 transitions. [2024-10-12 20:06:12,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:06:12,178 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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 99 [2024-10-12 20:06:12,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:06:12,361 INFO L225 Difference]: With dead ends: 178890 [2024-10-12 20:06:12,362 INFO L226 Difference]: Without dead ends: 164232 [2024-10-12 20:06:12,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:06:12,393 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 1255 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:06:12,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 1470 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:06:12,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164232 states. [2024-10-12 20:06:15,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164232 to 95354. [2024-10-12 20:06:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95354 states, 95353 states have (on average 1.4449991085755036) internal successors, (137785), 95353 states have internal predecessors, (137785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:06:15,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95354 states to 95354 states and 137785 transitions. [2024-10-12 20:06:15,241 INFO L78 Accepts]: Start accepts. Automaton has 95354 states and 137785 transitions. Word has length 99 [2024-10-12 20:06:15,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:06:15,241 INFO L471 AbstractCegarLoop]: Abstraction has 95354 states and 137785 transitions. [2024-10-12 20:06:15,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:06:15,241 INFO L276 IsEmpty]: Start isEmpty. Operand 95354 states and 137785 transitions. [2024-10-12 20:06:15,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 20:06:15,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:06:15,245 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:06:15,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:06:15,245 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:06:15,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:06:15,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1283744429, now seen corresponding path program 1 times [2024-10-12 20:06:15,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:06:15,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439514144] [2024-10-12 20:06:15,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:06:15,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:06:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:06:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 20:06:15,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:06:15,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439514144] [2024-10-12 20:06:15,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439514144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:06:15,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:06:15,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:06:15,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320850829] [2024-10-12 20:06:15,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:06:15,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:06:15,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:06:15,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:06:15,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:06:15,389 INFO L87 Difference]: Start difference. First operand 95354 states and 137785 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:06:18,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:06:18,830 INFO L93 Difference]: Finished difference Result 193546 states and 281153 transitions. [2024-10-12 20:06:18,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:06:18,834 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 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 20:06:18,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:06:19,073 INFO L225 Difference]: With dead ends: 193546 [2024-10-12 20:06:19,073 INFO L226 Difference]: Without dead ends: 178888 [2024-10-12 20:06:19,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:06:19,110 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 1254 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:06:19,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 1591 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:06:19,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178888 states. [2024-10-12 20:06:22,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178888 to 110010. [2024-10-12 20:06:22,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110010 states, 110009 states have (on average 1.4450544955412739) internal successors, (158969), 110009 states have internal predecessors, (158969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:06:22,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110010 states to 110010 states and 158969 transitions. [2024-10-12 20:06:22,466 INFO L78 Accepts]: Start accepts. Automaton has 110010 states and 158969 transitions. Word has length 99 [2024-10-12 20:06:22,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:06:22,466 INFO L471 AbstractCegarLoop]: Abstraction has 110010 states and 158969 transitions. [2024-10-12 20:06:22,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:06:22,467 INFO L276 IsEmpty]: Start isEmpty. Operand 110010 states and 158969 transitions. [2024-10-12 20:06:22,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:06:22,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:06:22,475 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:06:22,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:06:22,476 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:06:22,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:06:22,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1656590734, now seen corresponding path program 1 times [2024-10-12 20:06:22,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:06:22,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079745258] [2024-10-12 20:06:22,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:06:22,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:06:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:06:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:06:22,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:06:22,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079745258] [2024-10-12 20:06:22,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079745258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:06:22,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:06:22,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:06:22,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138328800] [2024-10-12 20:06:22,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:06:22,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:06:22,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:06:22,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:06:22,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:06:22,622 INFO L87 Difference]: Start difference. First operand 110010 states and 158969 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:06:26,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:06:26,500 INFO L93 Difference]: Finished difference Result 199370 states and 289793 transitions. [2024-10-12 20:06:26,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:06:26,501 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 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 20:06:26,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:06:26,752 INFO L225 Difference]: With dead ends: 199370 [2024-10-12 20:06:26,752 INFO L226 Difference]: Without dead ends: 189128 [2024-10-12 20:06:26,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:06:26,791 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 1317 mSDsluCounter, 1387 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:06:26,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 1613 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:06:26,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189128 states.