./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.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 9db88713350d7306821dd75614e70e6b858505d66168ef8348e173e7f0890ab2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 14:41:06,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 14:41:06,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 14:41:06,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 14:41:06,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 14:41:06,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 14:41:06,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 14:41:06,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 14:41:06,790 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 14:41:06,790 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 14:41:06,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 14:41:06,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 14:41:06,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 14:41:06,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 14:41:06,792 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 14:41:06,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 14:41:06,793 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 14:41:06,793 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 14:41:06,794 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 14:41:06,794 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 14:41:06,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 14:41:06,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 14:41:06,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 14:41:06,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 14:41:06,799 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 14:41:06,799 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 14:41:06,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 14:41:06,800 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 14:41:06,800 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 14:41:06,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 14:41:06,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 14:41:06,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 14:41:06,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:41:06,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 14:41:06,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 14:41:06,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 14:41:06,806 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 14:41:06,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 14:41:06,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 14:41:06,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 14:41:06,807 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 14:41:06,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 14:41:06,808 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 -> 9db88713350d7306821dd75614e70e6b858505d66168ef8348e173e7f0890ab2 [2024-11-18 14:41:07,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 14:41:07,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 14:41:07,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 14:41:07,077 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 14:41:07,078 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 14:41:07,080 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c [2024-11-18 14:41:08,621 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 14:41:08,818 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 14:41:08,819 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c [2024-11-18 14:41:08,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1397328a3/183505d0dbbc493681127910a8f4f287/FLAG8f716c74d [2024-11-18 14:41:08,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1397328a3/183505d0dbbc493681127910a8f4f287 [2024-11-18 14:41:08,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 14:41:08,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 14:41:08,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 14:41:08,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 14:41:08,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 14:41:08,855 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:41:08" (1/1) ... [2024-11-18 14:41:08,856 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54818fcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:41:08, skipping insertion in model container [2024-11-18 14:41:08,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:41:08" (1/1) ... [2024-11-18 14:41:08,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 14:41:09,184 WARN L250 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c[9529,9542] [2024-11-18 14:41:09,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:41:09,200 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 14:41:09,244 WARN L250 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c[9529,9542] [2024-11-18 14:41:09,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:41:09,266 INFO L204 MainTranslator]: Completed translation [2024-11-18 14:41:09,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:41:09 WrapperNode [2024-11-18 14:41:09,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 14:41:09,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 14:41:09,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 14:41:09,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 14:41:09,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:41:09" (1/1) ... [2024-11-18 14:41:09,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:41:09" (1/1) ... [2024-11-18 14:41:09,318 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 316 [2024-11-18 14:41:09,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 14:41:09,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 14:41:09,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 14:41:09,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 14:41:09,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:41:09" (1/1) ... [2024-11-18 14:41:09,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:41:09" (1/1) ... [2024-11-18 14:41:09,345 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:41:09" (1/1) ... [2024-11-18 14:41:09,370 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-11-18 14:41:09,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:41:09" (1/1) ... [2024-11-18 14:41:09,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:41:09" (1/1) ... [2024-11-18 14:41:09,377 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:41:09" (1/1) ... [2024-11-18 14:41:09,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:41:09" (1/1) ... [2024-11-18 14:41:09,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:41:09" (1/1) ... [2024-11-18 14:41:09,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:41:09" (1/1) ... [2024-11-18 14:41:09,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 14:41:09,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 14:41:09,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 14:41:09,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 14:41:09,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:41:09" (1/1) ... [2024-11-18 14:41:09,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:41:09,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:41:09,438 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-11-18 14:41:09,440 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-11-18 14:41:09,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 14:41:09,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 14:41:09,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 14:41:09,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 14:41:09,590 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 14:41:09,595 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 14:41:10,097 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-18 14:41:10,097 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 14:41:10,115 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 14:41:10,115 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 14:41:10,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:41:10 BoogieIcfgContainer [2024-11-18 14:41:10,116 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 14:41:10,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 14:41:10,119 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 14:41:10,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 14:41:10,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:41:08" (1/3) ... [2024-11-18 14:41:10,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408d0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:41:10, skipping insertion in model container [2024-11-18 14:41:10,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:41:09" (2/3) ... [2024-11-18 14:41:10,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408d0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:41:10, skipping insertion in model container [2024-11-18 14:41:10,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:41:10" (3/3) ... [2024-11-18 14:41:10,126 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c [2024-11-18 14:41:10,144 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 14:41:10,145 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 14:41:10,219 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 14:41:10,226 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;@571a496e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 14:41:10,227 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 14:41:10,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 84 states have (on average 1.7261904761904763) internal successors, (145), 85 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:10,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-18 14:41:10,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:41:10,239 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] [2024-11-18 14:41:10,240 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:41:10,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:41:10,246 INFO L85 PathProgramCache]: Analyzing trace with hash -182548282, now seen corresponding path program 1 times [2024-11-18 14:41:10,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:41:10,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564008426] [2024-11-18 14:41:10,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:41:10,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:41:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:41:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:41:10,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:41:10,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564008426] [2024-11-18 14:41:10,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564008426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:41:10,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:41:10,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 14:41:10,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611049429] [2024-11-18 14:41:10,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:41:10,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 14:41:10,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:41:10,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 14:41:10,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 14:41:10,577 INFO L87 Difference]: Start difference. First operand has 86 states, 84 states have (on average 1.7261904761904763) internal successors, (145), 85 states have internal predecessors, (145), 0 states have call successors, (0), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:41:10,597 INFO L93 Difference]: Finished difference Result 139 states and 233 transitions. [2024-11-18 14:41:10,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 14:41:10,599 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-18 14:41:10,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:41:10,606 INFO L225 Difference]: With dead ends: 139 [2024-11-18 14:41:10,606 INFO L226 Difference]: Without dead ends: 82 [2024-11-18 14:41:10,609 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-11-18 14:41:10,611 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:41:10,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:41:10,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-18 14:41:10,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-18 14:41:10,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.7037037037037037) internal successors, (138), 81 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 138 transitions. [2024-11-18 14:41:10,650 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 138 transitions. Word has length 29 [2024-11-18 14:41:10,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:41:10,651 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 138 transitions. [2024-11-18 14:41:10,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 138 transitions. [2024-11-18 14:41:10,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-18 14:41:10,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:41:10,653 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] [2024-11-18 14:41:10,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 14:41:10,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:41:10,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:41:10,654 INFO L85 PathProgramCache]: Analyzing trace with hash -316561788, now seen corresponding path program 1 times [2024-11-18 14:41:10,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:41:10,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621142510] [2024-11-18 14:41:10,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:41:10,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:41:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:41:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:41:10,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:41:10,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621142510] [2024-11-18 14:41:10,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621142510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:41:10,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:41:10,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:41:10,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786186090] [2024-11-18 14:41:10,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:41:10,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:41:10,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:41:10,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:41:10,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:41:10,926 INFO L87 Difference]: Start difference. First operand 82 states and 138 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:11,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:41:11,008 INFO L93 Difference]: Finished difference Result 138 states and 226 transitions. [2024-11-18 14:41:11,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:41:11,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-18 14:41:11,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:41:11,010 INFO L225 Difference]: With dead ends: 138 [2024-11-18 14:41:11,010 INFO L226 Difference]: Without dead ends: 82 [2024-11-18 14:41:11,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:41:11,012 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:41:11,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 515 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:41:11,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-18 14:41:11,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-18 14:41:11,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 81 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:11,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 114 transitions. [2024-11-18 14:41:11,020 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 114 transitions. Word has length 29 [2024-11-18 14:41:11,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:41:11,020 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 114 transitions. [2024-11-18 14:41:11,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:11,020 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 114 transitions. [2024-11-18 14:41:11,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-18 14:41:11,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:41:11,022 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] [2024-11-18 14:41:11,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 14:41:11,022 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:41:11,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:41:11,023 INFO L85 PathProgramCache]: Analyzing trace with hash 672474749, now seen corresponding path program 1 times [2024-11-18 14:41:11,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:41:11,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699571702] [2024-11-18 14:41:11,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:41:11,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:41:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:41:11,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:41:11,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:41:11,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699571702] [2024-11-18 14:41:11,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699571702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:41:11,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:41:11,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:41:11,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847116144] [2024-11-18 14:41:11,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:41:11,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:41:11,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:41:11,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:41:11,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:41:11,164 INFO L87 Difference]: Start difference. First operand 82 states and 114 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:11,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:41:11,193 INFO L93 Difference]: Finished difference Result 178 states and 268 transitions. [2024-11-18 14:41:11,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:41:11,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-11-18 14:41:11,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:41:11,195 INFO L225 Difference]: With dead ends: 178 [2024-11-18 14:41:11,196 INFO L226 Difference]: Without dead ends: 126 [2024-11-18 14:41:11,196 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-11-18 14:41:11,197 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 60 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:41:11,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 219 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:41:11,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-18 14:41:11,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2024-11-18 14:41:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.4796747967479675) internal successors, (182), 123 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:11,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 182 transitions. [2024-11-18 14:41:11,222 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 182 transitions. Word has length 52 [2024-11-18 14:41:11,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:41:11,226 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 182 transitions. [2024-11-18 14:41:11,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:11,226 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 182 transitions. [2024-11-18 14:41:11,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-18 14:41:11,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:41:11,231 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] [2024-11-18 14:41:11,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 14:41:11,231 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:41:11,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:41:11,232 INFO L85 PathProgramCache]: Analyzing trace with hash -221780930, now seen corresponding path program 1 times [2024-11-18 14:41:11,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:41:11,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103603597] [2024-11-18 14:41:11,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:41:11,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:41:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:41:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:41:11,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:41:11,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103603597] [2024-11-18 14:41:11,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103603597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:41:11,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:41:11,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 14:41:11,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055650409] [2024-11-18 14:41:11,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:41:11,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 14:41:11,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:41:11,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 14:41:11,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:41:11,505 INFO L87 Difference]: Start difference. First operand 124 states and 182 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:11,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:41:11,668 INFO L93 Difference]: Finished difference Result 594 states and 942 transitions. [2024-11-18 14:41:11,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 14:41:11,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-11-18 14:41:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:41:11,677 INFO L225 Difference]: With dead ends: 594 [2024-11-18 14:41:11,677 INFO L226 Difference]: Without dead ends: 500 [2024-11-18 14:41:11,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-18 14:41:11,679 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 664 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:41:11,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 606 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:41:11,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2024-11-18 14:41:11,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 216. [2024-11-18 14:41:11,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.5302325581395348) internal successors, (329), 215 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:11,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 329 transitions. [2024-11-18 14:41:11,707 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 329 transitions. Word has length 52 [2024-11-18 14:41:11,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:41:11,708 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 329 transitions. [2024-11-18 14:41:11,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:11,708 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 329 transitions. [2024-11-18 14:41:11,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-18 14:41:11,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:41:11,710 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] [2024-11-18 14:41:11,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 14:41:11,710 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:41:11,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:41:11,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1331402393, now seen corresponding path program 1 times [2024-11-18 14:41:11,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:41:11,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104244614] [2024-11-18 14:41:11,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:41:11,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:41:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:41:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:41:12,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:41:12,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104244614] [2024-11-18 14:41:12,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104244614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:41:12,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:41:12,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 14:41:12,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042742807] [2024-11-18 14:41:12,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:41:12,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 14:41:12,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:41:12,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 14:41:12,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 14:41:12,091 INFO L87 Difference]: Start difference. First operand 216 states and 329 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:12,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:41:12,146 INFO L93 Difference]: Finished difference Result 230 states and 346 transitions. [2024-11-18 14:41:12,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 14:41:12,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-11-18 14:41:12,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:41:12,148 INFO L225 Difference]: With dead ends: 230 [2024-11-18 14:41:12,148 INFO L226 Difference]: Without dead ends: 228 [2024-11-18 14:41:12,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 14:41:12,150 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:41:12,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 744 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:41:12,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-18 14:41:12,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-11-18 14:41:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.502202643171806) internal successors, (341), 227 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:12,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 341 transitions. [2024-11-18 14:41:12,162 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 341 transitions. Word has length 53 [2024-11-18 14:41:12,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:41:12,162 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 341 transitions. [2024-11-18 14:41:12,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:12,163 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 341 transitions. [2024-11-18 14:41:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-18 14:41:12,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:41:12,164 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] [2024-11-18 14:41:12,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 14:41:12,165 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:41:12,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:41:12,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1623620234, now seen corresponding path program 1 times [2024-11-18 14:41:12,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:41:12,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574962567] [2024-11-18 14:41:12,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:41:12,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:41:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:41:12,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:41:12,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:41:12,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574962567] [2024-11-18 14:41:12,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574962567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:41:12,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:41:12,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:41:12,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707566214] [2024-11-18 14:41:12,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:41:12,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:41:12,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:41:12,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:41:12,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:41:12,251 INFO L87 Difference]: Start difference. First operand 228 states and 341 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:12,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:41:12,277 INFO L93 Difference]: Finished difference Result 594 states and 913 transitions. [2024-11-18 14:41:12,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:41:12,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-11-18 14:41:12,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:41:12,280 INFO L225 Difference]: With dead ends: 594 [2024-11-18 14:41:12,280 INFO L226 Difference]: Without dead ends: 396 [2024-11-18 14:41:12,281 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-11-18 14:41:12,285 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 52 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:41:12,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 190 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:41:12,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-18 14:41:12,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 390. [2024-11-18 14:41:12,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.5141388174807198) internal successors, (589), 389 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:12,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 589 transitions. [2024-11-18 14:41:12,317 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 589 transitions. Word has length 54 [2024-11-18 14:41:12,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:41:12,317 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 589 transitions. [2024-11-18 14:41:12,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:12,318 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 589 transitions. [2024-11-18 14:41:12,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-18 14:41:12,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:41:12,320 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] [2024-11-18 14:41:12,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 14:41:12,320 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:41:12,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:41:12,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1627419246, now seen corresponding path program 1 times [2024-11-18 14:41:12,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:41:12,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559865344] [2024-11-18 14:41:12,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:41:12,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:41:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:41:12,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:41:12,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:41:12,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559865344] [2024-11-18 14:41:12,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559865344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:41:12,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:41:12,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:41:12,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679195038] [2024-11-18 14:41:12,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:41:12,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:41:12,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:41:12,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:41:12,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:41:12,412 INFO L87 Difference]: Start difference. First operand 390 states and 589 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:12,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:41:12,442 INFO L93 Difference]: Finished difference Result 1046 states and 1595 transitions. [2024-11-18 14:41:12,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:41:12,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-11-18 14:41:12,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:41:12,446 INFO L225 Difference]: With dead ends: 1046 [2024-11-18 14:41:12,446 INFO L226 Difference]: Without dead ends: 686 [2024-11-18 14:41:12,447 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-11-18 14:41:12,448 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 64 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:41:12,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 233 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:41:12,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-11-18 14:41:12,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 684. [2024-11-18 14:41:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 1.5036603221083455) internal successors, (1027), 683 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:12,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1027 transitions. [2024-11-18 14:41:12,471 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1027 transitions. Word has length 55 [2024-11-18 14:41:12,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:41:12,473 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1027 transitions. [2024-11-18 14:41:12,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:12,473 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1027 transitions. [2024-11-18 14:41:12,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-18 14:41:12,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:41:12,478 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] [2024-11-18 14:41:12,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 14:41:12,479 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:41:12,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:41:12,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1310378098, now seen corresponding path program 1 times [2024-11-18 14:41:12,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:41:12,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243704083] [2024-11-18 14:41:12,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:41:12,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:41:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:41:12,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:41:12,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:41:12,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243704083] [2024-11-18 14:41:12,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243704083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:41:12,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:41:12,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:41:12,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055628278] [2024-11-18 14:41:12,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:41:12,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:41:12,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:41:12,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:41:12,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:41:12,562 INFO L87 Difference]: Start difference. First operand 684 states and 1027 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:12,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:41:12,600 INFO L93 Difference]: Finished difference Result 1864 states and 2797 transitions. [2024-11-18 14:41:12,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:41:12,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-11-18 14:41:12,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:41:12,606 INFO L225 Difference]: With dead ends: 1864 [2024-11-18 14:41:12,606 INFO L226 Difference]: Without dead ends: 1210 [2024-11-18 14:41:12,608 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-11-18 14:41:12,608 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 68 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:41:12,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 246 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:41:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2024-11-18 14:41:12,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1208. [2024-11-18 14:41:12,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 1207 states have (on average 1.4772162386081193) internal successors, (1783), 1207 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:12,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1783 transitions. [2024-11-18 14:41:12,643 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1783 transitions. Word has length 55 [2024-11-18 14:41:12,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:41:12,644 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1783 transitions. [2024-11-18 14:41:12,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:12,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1783 transitions. [2024-11-18 14:41:12,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-18 14:41:12,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:41:12,647 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:41:12,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 14:41:12,647 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:41:12,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:41:12,647 INFO L85 PathProgramCache]: Analyzing trace with hash -223123120, now seen corresponding path program 1 times [2024-11-18 14:41:12,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:41:12,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34400283] [2024-11-18 14:41:12,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:41:12,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:41:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:41:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:41:12,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:41:12,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34400283] [2024-11-18 14:41:12,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34400283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:41:12,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:41:12,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:41:12,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071120300] [2024-11-18 14:41:12,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:41:12,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:41:12,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:41:12,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:41:12,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:41:12,716 INFO L87 Difference]: Start difference. First operand 1208 states and 1783 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:12,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:41:12,777 INFO L93 Difference]: Finished difference Result 2367 states and 3517 transitions. [2024-11-18 14:41:12,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:41:12,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-11-18 14:41:12,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:41:12,785 INFO L225 Difference]: With dead ends: 2367 [2024-11-18 14:41:12,786 INFO L226 Difference]: Without dead ends: 1708 [2024-11-18 14:41:12,787 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-11-18 14:41:12,788 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 69 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:41:12,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 255 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:41:12,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2024-11-18 14:41:12,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1706. [2024-11-18 14:41:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1705 states have (on average 1.4645161290322581) internal successors, (2497), 1705 states have internal predecessors, (2497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:12,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2497 transitions. [2024-11-18 14:41:12,836 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2497 transitions. Word has length 56 [2024-11-18 14:41:12,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:41:12,836 INFO L471 AbstractCegarLoop]: Abstraction has 1706 states and 2497 transitions. [2024-11-18 14:41:12,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:12,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2497 transitions. [2024-11-18 14:41:12,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-18 14:41:12,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:41:12,839 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:41:12,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 14:41:12,840 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:41:12,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:41:12,843 INFO L85 PathProgramCache]: Analyzing trace with hash 53976900, now seen corresponding path program 1 times [2024-11-18 14:41:12,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:41:12,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983215809] [2024-11-18 14:41:12,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:41:12,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:41:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:41:12,996 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-18 14:41:12,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:41:12,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983215809] [2024-11-18 14:41:12,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983215809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:41:12,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:41:12,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 14:41:12,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438514568] [2024-11-18 14:41:12,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:41:12,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 14:41:12,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:41:13,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 14:41:13,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:41:13,001 INFO L87 Difference]: Start difference. First operand 1706 states and 2497 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:13,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:41:13,145 INFO L93 Difference]: Finished difference Result 4812 states and 7146 transitions. [2024-11-18 14:41:13,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 14:41:13,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-18 14:41:13,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:41:13,161 INFO L225 Difference]: With dead ends: 4812 [2024-11-18 14:41:13,162 INFO L226 Difference]: Without dead ends: 3962 [2024-11-18 14:41:13,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-18 14:41:13,165 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 556 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:41:13,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 599 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:41:13,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2024-11-18 14:41:13,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 2530. [2024-11-18 14:41:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2530 states, 2529 states have (on average 1.4665875840253064) internal successors, (3709), 2529 states have internal predecessors, (3709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:13,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2530 states and 3709 transitions. [2024-11-18 14:41:13,275 INFO L78 Accepts]: Start accepts. Automaton has 2530 states and 3709 transitions. Word has length 78 [2024-11-18 14:41:13,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:41:13,275 INFO L471 AbstractCegarLoop]: Abstraction has 2530 states and 3709 transitions. [2024-11-18 14:41:13,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2530 states and 3709 transitions. [2024-11-18 14:41:13,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-18 14:41:13,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:41:13,279 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:41:13,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 14:41:13,279 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:41:13,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:41:13,280 INFO L85 PathProgramCache]: Analyzing trace with hash -852456349, now seen corresponding path program 1 times [2024-11-18 14:41:13,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:41:13,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380545672] [2024-11-18 14:41:13,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:41:13,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:41:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:41:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-18 14:41:13,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:41:13,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380545672] [2024-11-18 14:41:13,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380545672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:41:13,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:41:13,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 14:41:13,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442540129] [2024-11-18 14:41:13,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:41:13,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 14:41:13,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:41:13,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 14:41:13,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:41:13,445 INFO L87 Difference]: Start difference. First operand 2530 states and 3709 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:13,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:41:13,605 INFO L93 Difference]: Finished difference Result 5636 states and 8358 transitions. [2024-11-18 14:41:13,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 14:41:13,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-18 14:41:13,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:41:13,624 INFO L225 Difference]: With dead ends: 5636 [2024-11-18 14:41:13,624 INFO L226 Difference]: Without dead ends: 4786 [2024-11-18 14:41:13,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-18 14:41:13,628 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 498 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:41:13,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 652 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:41:13,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4786 states. [2024-11-18 14:41:13,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4786 to 3354. [2024-11-18 14:41:13,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3354 states, 3353 states have (on average 1.4676409185803758) internal successors, (4921), 3353 states have internal predecessors, (4921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 4921 transitions. [2024-11-18 14:41:13,783 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 4921 transitions. Word has length 78 [2024-11-18 14:41:13,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:41:13,783 INFO L471 AbstractCegarLoop]: Abstraction has 3354 states and 4921 transitions. [2024-11-18 14:41:13,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 4921 transitions. [2024-11-18 14:41:13,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-18 14:41:13,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:41:13,786 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:41:13,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 14:41:13,786 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:41:13,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:41:13,787 INFO L85 PathProgramCache]: Analyzing trace with hash 2085340995, now seen corresponding path program 1 times [2024-11-18 14:41:13,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:41:13,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882310381] [2024-11-18 14:41:13,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:41:13,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:41:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:41:13,964 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-18 14:41:13,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:41:13,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882310381] [2024-11-18 14:41:13,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882310381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:41:13,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:41:13,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 14:41:13,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262562467] [2024-11-18 14:41:13,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:41:13,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 14:41:13,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:41:13,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 14:41:13,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:41:13,966 INFO L87 Difference]: Start difference. First operand 3354 states and 4921 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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-11-18 14:41:14,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:41:14,145 INFO L93 Difference]: Finished difference Result 6460 states and 9570 transitions. [2024-11-18 14:41:14,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 14:41:14,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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 78 [2024-11-18 14:41:14,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:41:14,167 INFO L225 Difference]: With dead ends: 6460 [2024-11-18 14:41:14,167 INFO L226 Difference]: Without dead ends: 5610 [2024-11-18 14:41:14,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-18 14:41:14,171 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 540 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:41:14,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 632 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:41:14,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5610 states. [2024-11-18 14:41:14,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5610 to 4178. [2024-11-18 14:41:14,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4178 states, 4177 states have (on average 1.4682786689011251) internal successors, (6133), 4177 states have internal predecessors, (6133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4178 states to 4178 states and 6133 transitions. [2024-11-18 14:41:14,300 INFO L78 Accepts]: Start accepts. Automaton has 4178 states and 6133 transitions. Word has length 78 [2024-11-18 14:41:14,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:41:14,300 INFO L471 AbstractCegarLoop]: Abstraction has 4178 states and 6133 transitions. [2024-11-18 14:41:14,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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-11-18 14:41:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand 4178 states and 6133 transitions. [2024-11-18 14:41:14,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-18 14:41:14,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:41:14,303 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:41:14,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 14:41:14,303 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:41:14,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:41:14,304 INFO L85 PathProgramCache]: Analyzing trace with hash 760016253, now seen corresponding path program 1 times [2024-11-18 14:41:14,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:41:14,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005169482] [2024-11-18 14:41:14,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:41:14,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:41:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:41:14,439 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:41:14,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:41:14,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005169482] [2024-11-18 14:41:14,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005169482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:41:14,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:41:14,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:41:14,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391577045] [2024-11-18 14:41:14,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:41:14,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:41:14,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:41:14,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:41:14,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:41:14,442 INFO L87 Difference]: Start difference. First operand 4178 states and 6133 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-11-18 14:41:14,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:41:14,524 INFO L93 Difference]: Finished difference Result 8326 states and 12235 transitions. [2024-11-18 14:41:14,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:41:14,525 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-11-18 14:41:14,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:41:14,539 INFO L225 Difference]: With dead ends: 8326 [2024-11-18 14:41:14,540 INFO L226 Difference]: Without dead ends: 4180 [2024-11-18 14:41:14,546 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-11-18 14:41:14,547 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 55 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:41:14,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 246 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:41:14,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4180 states. [2024-11-18 14:41:14,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4180 to 4178. [2024-11-18 14:41:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4178 states, 4177 states have (on average 1.453914292554465) internal successors, (6073), 4177 states have internal predecessors, (6073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4178 states to 4178 states and 6073 transitions. [2024-11-18 14:41:14,666 INFO L78 Accepts]: Start accepts. Automaton has 4178 states and 6073 transitions. Word has length 79 [2024-11-18 14:41:14,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:41:14,666 INFO L471 AbstractCegarLoop]: Abstraction has 4178 states and 6073 transitions. [2024-11-18 14:41:14,667 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-11-18 14:41:14,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4178 states and 6073 transitions. [2024-11-18 14:41:14,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-18 14:41:14,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:41:14,668 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:41:14,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-18 14:41:14,669 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:41:14,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:41:14,669 INFO L85 PathProgramCache]: Analyzing trace with hash -2135446276, now seen corresponding path program 1 times [2024-11-18 14:41:14,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:41:14,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246610899] [2024-11-18 14:41:14,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:41:14,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:41:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:41:14,776 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:41:14,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:41:14,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246610899] [2024-11-18 14:41:14,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246610899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:41:14,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:41:14,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:41:14,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765670930] [2024-11-18 14:41:14,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:41:14,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:41:14,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:41:14,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:41:14,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:41:14,779 INFO L87 Difference]: Start difference. First operand 4178 states and 6073 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-11-18 14:41:14,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:41:14,864 INFO L93 Difference]: Finished difference Result 6254 states and 9095 transitions. [2024-11-18 14:41:14,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:41:14,865 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-11-18 14:41:14,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:41:14,875 INFO L225 Difference]: With dead ends: 6254 [2024-11-18 14:41:14,878 INFO L226 Difference]: Without dead ends: 2108 [2024-11-18 14:41:14,882 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-11-18 14:41:14,883 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 49 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:41:14,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 227 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:41:14,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2024-11-18 14:41:14,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 2106. [2024-11-18 14:41:14,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2106 states, 2105 states have (on average 1.436104513064133) internal successors, (3023), 2105 states have internal predecessors, (3023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:14,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 3023 transitions. [2024-11-18 14:41:14,943 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 3023 transitions. Word has length 79 [2024-11-18 14:41:14,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:41:14,944 INFO L471 AbstractCegarLoop]: Abstraction has 2106 states and 3023 transitions. [2024-11-18 14:41:14,944 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-11-18 14:41:14,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 3023 transitions. [2024-11-18 14:41:14,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-18 14:41:14,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:41:14,945 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:41:14,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-18 14:41:14,946 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:41:14,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:41:14,946 INFO L85 PathProgramCache]: Analyzing trace with hash 674497531, now seen corresponding path program 1 times [2024-11-18 14:41:14,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:41:14,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222452932] [2024-11-18 14:41:14,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:41:14,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:41:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:41:16,702 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:41:16,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:41:16,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222452932] [2024-11-18 14:41:16,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222452932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:41:16,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848708430] [2024-11-18 14:41:16,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:41:16,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:41:16,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:41:16,705 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 14:41:16,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 14:41:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:41:16,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-18 14:41:16,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:41:17,710 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:41:17,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:41:18,436 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:41:18,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848708430] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:41:18,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:41:18,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 28 [2024-11-18 14:41:18,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444271768] [2024-11-18 14:41:18,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:41:18,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-18 14:41:18,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:41:18,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-18 14:41:18,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2024-11-18 14:41:18,439 INFO L87 Difference]: Start difference. First operand 2106 states and 3023 transitions. Second operand has 28 states, 28 states have (on average 8.071428571428571) internal successors, (226), 28 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:31,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:41:31,565 INFO L93 Difference]: Finished difference Result 28942 states and 41152 transitions. [2024-11-18 14:41:31,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2024-11-18 14:41:31,565 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.071428571428571) internal successors, (226), 28 states have internal predecessors, (226), 0 states have call successors, (0), 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-11-18 14:41:31,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:41:31,614 INFO L225 Difference]: With dead ends: 28942 [2024-11-18 14:41:31,615 INFO L226 Difference]: Without dead ends: 26868 [2024-11-18 14:41:31,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18355 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=6567, Invalid=38589, Unknown=0, NotChecked=0, Total=45156 [2024-11-18 14:41:31,635 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 8396 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 1987 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8396 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-18 14:41:31,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8396 Valid, 1569 Invalid, 2237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1987 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-18 14:41:31,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26868 states. [2024-11-18 14:41:32,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26868 to 20546. [2024-11-18 14:41:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20546 states, 20545 states have (on average 1.3981017279143344) internal successors, (28724), 20545 states have internal predecessors, (28724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:32,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20546 states to 20546 states and 28724 transitions. [2024-11-18 14:41:32,359 INFO L78 Accepts]: Start accepts. Automaton has 20546 states and 28724 transitions. Word has length 79 [2024-11-18 14:41:32,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:41:32,360 INFO L471 AbstractCegarLoop]: Abstraction has 20546 states and 28724 transitions. [2024-11-18 14:41:32,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.071428571428571) internal successors, (226), 28 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:32,361 INFO L276 IsEmpty]: Start isEmpty. Operand 20546 states and 28724 transitions. [2024-11-18 14:41:32,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-18 14:41:32,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:41:32,362 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:41:32,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 14:41:32,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-18 14:41:32,567 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:41:32,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:41:32,567 INFO L85 PathProgramCache]: Analyzing trace with hash -163654874, now seen corresponding path program 1 times [2024-11-18 14:41:32,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:41:32,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137872775] [2024-11-18 14:41:32,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:41:32,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:41:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:41:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 14:41:32,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:41:32,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137872775] [2024-11-18 14:41:32,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137872775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:41:32,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:41:32,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 14:41:32,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359515660] [2024-11-18 14:41:32,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:41:32,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 14:41:32,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:41:32,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 14:41:32,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:41:32,706 INFO L87 Difference]: Start difference. First operand 20546 states and 28724 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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-11-18 14:41:33,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:41:33,439 INFO L93 Difference]: Finished difference Result 37475 states and 52800 transitions. [2024-11-18 14:41:33,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 14:41:33,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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 80 [2024-11-18 14:41:33,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:41:33,504 INFO L225 Difference]: With dead ends: 37475 [2024-11-18 14:41:33,504 INFO L226 Difference]: Without dead ends: 33199 [2024-11-18 14:41:33,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-18 14:41:33,522 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 462 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:41:33,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 646 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:41:33,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33199 states. [2024-11-18 14:41:34,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33199 to 24630. [2024-11-18 14:41:34,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24630 states, 24629 states have (on average 1.3970928580129116) internal successors, (34409), 24629 states have internal predecessors, (34409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:34,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24630 states to 24630 states and 34409 transitions. [2024-11-18 14:41:34,283 INFO L78 Accepts]: Start accepts. Automaton has 24630 states and 34409 transitions. Word has length 80 [2024-11-18 14:41:34,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:41:34,283 INFO L471 AbstractCegarLoop]: Abstraction has 24630 states and 34409 transitions. [2024-11-18 14:41:34,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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-11-18 14:41:34,284 INFO L276 IsEmpty]: Start isEmpty. Operand 24630 states and 34409 transitions. [2024-11-18 14:41:34,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-18 14:41:34,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:41:34,285 INFO L215 NwaCegarLoop]: trace histogram [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-11-18 14:41:34,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-18 14:41:34,285 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:41:34,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:41:34,286 INFO L85 PathProgramCache]: Analyzing trace with hash -269357657, now seen corresponding path program 1 times [2024-11-18 14:41:34,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:41:34,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463541903] [2024-11-18 14:41:34,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:41:34,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:41:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:41:35,585 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:41:35,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:41:35,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463541903] [2024-11-18 14:41:35,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463541903] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:41:35,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38783380] [2024-11-18 14:41:35,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:41:35,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:41:35,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:41:35,587 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 14:41:35,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 14:41:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:41:35,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-18 14:41:35,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:41:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:41:36,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:41:38,960 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:41:38,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38783380] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:41:38,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:41:38,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 35 [2024-11-18 14:41:38,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47030174] [2024-11-18 14:41:38,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:41:38,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-18 14:41:38,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:41:38,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-18 14:41:38,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1030, Unknown=0, NotChecked=0, Total=1190 [2024-11-18 14:41:38,963 INFO L87 Difference]: Start difference. First operand 24630 states and 34409 transitions. Second operand has 35 states, 35 states have (on average 6.371428571428571) internal successors, (223), 35 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:42:02,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:42:02,083 INFO L93 Difference]: Finished difference Result 237968 states and 331786 transitions. [2024-11-18 14:42:02,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 396 states. [2024-11-18 14:42:02,083 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 6.371428571428571) internal successors, (223), 35 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-18 14:42:02,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:42:02,468 INFO L225 Difference]: With dead ends: 237968 [2024-11-18 14:42:02,469 INFO L226 Difference]: Without dead ends: 213372 [2024-11-18 14:42:02,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 427 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82230 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=20054, Invalid=163558, Unknown=0, NotChecked=0, Total=183612 [2024-11-18 14:42:02,531 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 10965 mSDsluCounter, 3450 mSDsCounter, 0 mSdLazyCounter, 4578 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10965 SdHoareTripleChecker+Valid, 3682 SdHoareTripleChecker+Invalid, 4862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 4578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-18 14:42:02,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10965 Valid, 3682 Invalid, 4862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 4578 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-18 14:42:02,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213372 states. [2024-11-18 14:42:05,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213372 to 92039. [2024-11-18 14:42:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92039 states, 92038 states have (on average 1.3789630370064538) internal successors, (126917), 92038 states have internal predecessors, (126917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:42:06,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92039 states to 92039 states and 126917 transitions. [2024-11-18 14:42:06,051 INFO L78 Accepts]: Start accepts. Automaton has 92039 states and 126917 transitions. Word has length 83 [2024-11-18 14:42:06,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:42:06,051 INFO L471 AbstractCegarLoop]: Abstraction has 92039 states and 126917 transitions. [2024-11-18 14:42:06,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.371428571428571) internal successors, (223), 35 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:42:06,052 INFO L276 IsEmpty]: Start isEmpty. Operand 92039 states and 126917 transitions. [2024-11-18 14:42:06,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-18 14:42:06,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:42:06,055 INFO L215 NwaCegarLoop]: trace histogram [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-11-18 14:42:06,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-18 14:42:06,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-18 14:42:06,256 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:42:06,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:42:06,256 INFO L85 PathProgramCache]: Analyzing trace with hash -244055323, now seen corresponding path program 1 times [2024-11-18 14:42:06,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:42:06,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722767578] [2024-11-18 14:42:06,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:42:06,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:42:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:42:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:42:06,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:42:06,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722767578] [2024-11-18 14:42:06,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722767578] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:42:06,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910114099] [2024-11-18 14:42:06,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:42:06,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:42:06,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:42:06,706 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 14:42:06,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 14:42:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:42:06,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-18 14:42:06,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:42:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:42:07,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:42:08,366 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:42:08,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910114099] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:42:08,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:42:08,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-18 14:42:08,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812046168] [2024-11-18 14:42:08,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:42:08,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-18 14:42:08,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:42:08,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-18 14:42:08,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2024-11-18 14:42:08,368 INFO L87 Difference]: Start difference. First operand 92039 states and 126917 transitions. Second operand has 21 states, 21 states have (on average 8.761904761904763) internal successors, (184), 20 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:42:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:42:13,886 INFO L93 Difference]: Finished difference Result 344585 states and 477843 transitions. [2024-11-18 14:42:13,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-18 14:42:13,887 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.761904761904763) internal successors, (184), 20 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-18 14:42:13,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:42:14,464 INFO L225 Difference]: With dead ends: 344585 [2024-11-18 14:42:14,465 INFO L226 Difference]: Without dead ends: 253370 [2024-11-18 14:42:14,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2024-11-18 14:42:14,573 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 908 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 14:42:14,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 892 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 14:42:14,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253370 states. [2024-11-18 14:42:21,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253370 to 245836. [2024-11-18 14:42:21,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245836 states, 245835 states have (on average 1.3603270486301788) internal successors, (334416), 245835 states have internal predecessors, (334416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:42:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245836 states to 245836 states and 334416 transitions. [2024-11-18 14:42:22,750 INFO L78 Accepts]: Start accepts. Automaton has 245836 states and 334416 transitions. Word has length 83 [2024-11-18 14:42:22,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:42:22,750 INFO L471 AbstractCegarLoop]: Abstraction has 245836 states and 334416 transitions. [2024-11-18 14:42:22,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.761904761904763) internal successors, (184), 20 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:42:22,751 INFO L276 IsEmpty]: Start isEmpty. Operand 245836 states and 334416 transitions. [2024-11-18 14:42:22,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-18 14:42:22,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:42:22,755 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:42:22,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 14:42:22,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-18 14:42:22,956 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:42:22,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:42:22,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1898938982, now seen corresponding path program 1 times [2024-11-18 14:42:22,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:42:22,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442360196] [2024-11-18 14:42:22,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:42:22,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:42:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:42:23,037 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:42:23,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:42:23,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442360196] [2024-11-18 14:42:23,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442360196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:42:23,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:42:23,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:42:23,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580518633] [2024-11-18 14:42:23,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:42:23,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:42:23,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:42:23,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:42:23,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:42:23,041 INFO L87 Difference]: Start difference. First operand 245836 states and 334416 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)