./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ca658a8a4271e1b6abd8c554fa2f86da0f765323e5a4dbf7051e477838d5322c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:39:15,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:39:15,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:39:15,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:39:15,272 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:39:15,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:39:15,297 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:39:15,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:39:15,299 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:39:15,300 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:39:15,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:39:15,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:39:15,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:39:15,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:39:15,303 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:39:15,303 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:39:15,303 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:39:15,303 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:39:15,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:39:15,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:39:15,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:39:15,307 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:39:15,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:39:15,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:39:15,307 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:39:15,308 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:39:15,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:39:15,308 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:39:15,308 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:39:15,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:39:15,308 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:39:15,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:39:15,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:39:15,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:39:15,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:39:15,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:39:15,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:39:15,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:39:15,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:39:15,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:39:15,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:39:15,311 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:39:15,311 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 -> ca658a8a4271e1b6abd8c554fa2f86da0f765323e5a4dbf7051e477838d5322c [2024-11-11 22:39:15,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:39:15,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:39:15,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:39:15,623 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:39:15,624 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:39:15,625 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-11 22:39:16,989 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:39:17,337 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:39:17,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-11 22:39:17,368 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fe1a8530/1206f0e925124f8c9e9583d8a9b22040/FLAGf09864e00 [2024-11-11 22:39:17,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fe1a8530/1206f0e925124f8c9e9583d8a9b22040 [2024-11-11 22:39:17,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:39:17,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:39:17,564 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:39:17,564 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:39:17,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:39:17,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:39:17" (1/1) ... [2024-11-11 22:39:17,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e04ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:39:17, skipping insertion in model container [2024-11-11 22:39:17,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:39:17" (1/1) ... [2024-11-11 22:39:17,651 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:39:17,981 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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label02.c[8712,8725] [2024-11-11 22:39:18,043 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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label02.c[16002,16015] [2024-11-11 22:39:18,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:39:18,602 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:39:18,628 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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label02.c[8712,8725] [2024-11-11 22:39:18,636 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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label02.c[16002,16015] [2024-11-11 22:39:18,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:39:18,938 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:39:18,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:39:18 WrapperNode [2024-11-11 22:39:18,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:39:18,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:39:18,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:39:18,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:39:18,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:39:18" (1/1) ... [2024-11-11 22:39:18,982 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:39:18" (1/1) ... [2024-11-11 22:39:19,201 INFO L138 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5039 [2024-11-11 22:39:19,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:39:19,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:39:19,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:39:19,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:39:19,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:39:18" (1/1) ... [2024-11-11 22:39:19,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:39:18" (1/1) ... [2024-11-11 22:39:19,259 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:39:18" (1/1) ... [2024-11-11 22:39:19,400 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-11 22:39:19,401 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:39:18" (1/1) ... [2024-11-11 22:39:19,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:39:18" (1/1) ... [2024-11-11 22:39:19,530 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:39:18" (1/1) ... [2024-11-11 22:39:19,558 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:39:18" (1/1) ... [2024-11-11 22:39:19,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:39:18" (1/1) ... [2024-11-11 22:39:19,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:39:18" (1/1) ... [2024-11-11 22:39:19,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:39:19,659 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:39:19,659 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:39:19,660 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:39:19,661 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:39:18" (1/1) ... [2024-11-11 22:39:19,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:39:19,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:39:19,708 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-11 22:39:19,715 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-11 22:39:19,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:39:19,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:39:19,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:39:19,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:39:19,899 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:39:19,901 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:39:23,260 INFO L? ?]: Removed 739 outVars from TransFormulas that were not future-live. [2024-11-11 22:39:23,260 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:39:23,289 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:39:23,290 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 22:39:23,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:39:23 BoogieIcfgContainer [2024-11-11 22:39:23,293 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:39:23,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:39:23,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:39:23,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:39:23,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:39:17" (1/3) ... [2024-11-11 22:39:23,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55471cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:39:23, skipping insertion in model container [2024-11-11 22:39:23,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:39:18" (2/3) ... [2024-11-11 22:39:23,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55471cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:39:23, skipping insertion in model container [2024-11-11 22:39:23,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:39:23" (3/3) ... [2024-11-11 22:39:23,301 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-11 22:39:23,314 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:39:23,314 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:39:23,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:39:23,388 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;@268e4caa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:39:23,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:39:23,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 887 states, 884 states have (on average 1.9049773755656108) internal successors, (1684), 886 states have internal predecessors, (1684), 0 states have call successors, (0), 0 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-11 22:39:23,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-11 22:39:23,401 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:39:23,402 INFO L218 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] [2024-11-11 22:39:23,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:39:23,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:39:23,407 INFO L85 PathProgramCache]: Analyzing trace with hash 593970293, now seen corresponding path program 1 times [2024-11-11 22:39:23,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:39:23,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085569814] [2024-11-11 22:39:23,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:23,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:39:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:23,669 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-11 22:39:23,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:39:23,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085569814] [2024-11-11 22:39:23,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085569814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:39:23,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:39:23,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 22:39:23,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468001519] [2024-11-11 22:39:23,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:39:23,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 22:39:23,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:39:23,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 22:39:23,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 22:39:23,703 INFO L87 Difference]: Start difference. First operand has 887 states, 884 states have (on average 1.9049773755656108) internal successors, (1684), 886 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-11 22:39:23,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:39:23,777 INFO L93 Difference]: Finished difference Result 1743 states and 3312 transitions. [2024-11-11 22:39:23,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 22:39:23,783 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-11 22:39:23,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:39:23,800 INFO L225 Difference]: With dead ends: 1743 [2024-11-11 22:39:23,800 INFO L226 Difference]: Without dead ends: 821 [2024-11-11 22:39:23,806 INFO L434 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-11 22:39:23,809 INFO L435 NwaCegarLoop]: 1615 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, 1615 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-11 22:39:23,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:39:23,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2024-11-11 22:39:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 821. [2024-11-11 22:39:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 819 states have (on average 1.8937728937728937) internal successors, (1551), 820 states have internal predecessors, (1551), 0 states have call successors, (0), 0 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-11 22:39:23,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1551 transitions. [2024-11-11 22:39:23,881 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1551 transitions. Word has length 22 [2024-11-11 22:39:23,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:39:23,881 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1551 transitions. [2024-11-11 22:39:23,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-11 22:39:23,882 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1551 transitions. [2024-11-11 22:39:23,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-11 22:39:23,883 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:39:23,883 INFO L218 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] [2024-11-11 22:39:23,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:39:23,884 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:39:23,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:39:23,885 INFO L85 PathProgramCache]: Analyzing trace with hash -427098061, now seen corresponding path program 1 times [2024-11-11 22:39:23,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:39:23,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190868778] [2024-11-11 22:39:23,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:23,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:39:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:24,079 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-11 22:39:24,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:39:24,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190868778] [2024-11-11 22:39:24,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190868778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:39:24,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:39:24,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:39:24,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892415344] [2024-11-11 22:39:24,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:39:24,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:39:24,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:39:24,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:39:24,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:39:24,084 INFO L87 Difference]: Start difference. First operand 821 states and 1551 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-11 22:39:24,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:39:24,161 INFO L93 Difference]: Finished difference Result 863 states and 1615 transitions. [2024-11-11 22:39:24,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:39:24,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-11 22:39:24,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:39:24,165 INFO L225 Difference]: With dead ends: 863 [2024-11-11 22:39:24,165 INFO L226 Difference]: Without dead ends: 821 [2024-11-11 22:39:24,166 INFO L434 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-11 22:39:24,167 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 0 mSDsluCounter, 4619 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6168 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:39:24,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6168 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:39:24,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2024-11-11 22:39:24,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 821. [2024-11-11 22:39:24,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 819 states have (on average 1.8656898656898657) internal successors, (1528), 820 states have internal predecessors, (1528), 0 states have call successors, (0), 0 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-11 22:39:24,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1528 transitions. [2024-11-11 22:39:24,181 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1528 transitions. Word has length 22 [2024-11-11 22:39:24,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:39:24,182 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1528 transitions. [2024-11-11 22:39:24,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-11 22:39:24,182 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1528 transitions. [2024-11-11 22:39:24,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-11 22:39:24,185 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:39:24,185 INFO L218 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] [2024-11-11 22:39:24,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:39:24,186 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:39:24,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:39:24,187 INFO L85 PathProgramCache]: Analyzing trace with hash 3301806, now seen corresponding path program 1 times [2024-11-11 22:39:24,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:39:24,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731836199] [2024-11-11 22:39:24,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:24,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:39:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:24,333 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-11 22:39:24,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:39:24,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731836199] [2024-11-11 22:39:24,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731836199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:39:24,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:39:24,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:39:24,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529901740] [2024-11-11 22:39:24,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:39:24,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:39:24,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:39:24,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:39:24,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:39:24,338 INFO L87 Difference]: Start difference. First operand 821 states and 1528 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-11 22:39:24,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:39:24,504 INFO L93 Difference]: Finished difference Result 1125 states and 2008 transitions. [2024-11-11 22:39:24,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:39:24,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-11-11 22:39:24,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:39:24,507 INFO L225 Difference]: With dead ends: 1125 [2024-11-11 22:39:24,509 INFO L226 Difference]: Without dead ends: 1087 [2024-11-11 22:39:24,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:39:24,513 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 6285 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6285 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:39:24,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6285 Valid, 2135 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:39:24,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2024-11-11 22:39:24,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 857. [2024-11-11 22:39:24,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 855 states have (on average 1.8538011695906433) internal successors, (1585), 856 states have internal predecessors, (1585), 0 states have call successors, (0), 0 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-11 22:39:24,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1585 transitions. [2024-11-11 22:39:24,533 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1585 transitions. Word has length 44 [2024-11-11 22:39:24,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:39:24,536 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1585 transitions. [2024-11-11 22:39:24,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-11 22:39:24,536 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1585 transitions. [2024-11-11 22:39:24,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 22:39:24,537 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:39:24,537 INFO L218 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] [2024-11-11 22:39:24,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:39:24,539 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:39:24,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:39:24,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1757336638, now seen corresponding path program 1 times [2024-11-11 22:39:24,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:39:24,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507760590] [2024-11-11 22:39:24,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:24,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:39:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:24,624 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-11 22:39:24,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:39:24,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507760590] [2024-11-11 22:39:24,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507760590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:39:24,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:39:24,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:39:24,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861541923] [2024-11-11 22:39:24,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:39:24,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:39:24,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:39:24,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:39:24,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:39:24,627 INFO L87 Difference]: Start difference. First operand 857 states and 1585 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 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-11 22:39:24,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:39:24,655 INFO L93 Difference]: Finished difference Result 994 states and 1800 transitions. [2024-11-11 22:39:24,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:39:24,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-11-11 22:39:24,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:39:24,659 INFO L225 Difference]: With dead ends: 994 [2024-11-11 22:39:24,659 INFO L226 Difference]: Without dead ends: 920 [2024-11-11 22:39:24,659 INFO L434 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-11 22:39:24,663 INFO L435 NwaCegarLoop]: 1524 mSDtfsCounter, 1476 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:39:24,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1577 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:39:24,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-11-11 22:39:24,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 916. [2024-11-11 22:39:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 914 states have (on average 1.8326039387308535) internal successors, (1675), 915 states have internal predecessors, (1675), 0 states have call successors, (0), 0 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-11 22:39:24,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1675 transitions. [2024-11-11 22:39:24,681 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1675 transitions. Word has length 46 [2024-11-11 22:39:24,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:39:24,682 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1675 transitions. [2024-11-11 22:39:24,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 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-11 22:39:24,682 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1675 transitions. [2024-11-11 22:39:24,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 22:39:24,685 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:39:24,686 INFO L218 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] [2024-11-11 22:39:24,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:39:24,686 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:39:24,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:39:24,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1823830150, now seen corresponding path program 1 times [2024-11-11 22:39:24,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:39:24,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171324216] [2024-11-11 22:39:24,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:24,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:39:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:24,867 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-11 22:39:24,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:39:24,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171324216] [2024-11-11 22:39:24,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171324216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:39:24,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:39:24,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:39:24,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003375153] [2024-11-11 22:39:24,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:39:24,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:39:24,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:39:24,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:39:24,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:39:24,871 INFO L87 Difference]: Start difference. First operand 916 states and 1675 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 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-11 22:39:24,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:39:24,983 INFO L93 Difference]: Finished difference Result 1051 states and 1883 transitions. [2024-11-11 22:39:24,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:39:24,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-11-11 22:39:24,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:39:24,987 INFO L225 Difference]: With dead ends: 1051 [2024-11-11 22:39:24,988 INFO L226 Difference]: Without dead ends: 918 [2024-11-11 22:39:24,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:39:24,990 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 1493 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:39:24,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 1748 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:39:24,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2024-11-11 22:39:25,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 916. [2024-11-11 22:39:25,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 914 states have (on average 1.8304157549234135) internal successors, (1673), 915 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:39:25,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1673 transitions. [2024-11-11 22:39:25,007 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1673 transitions. Word has length 46 [2024-11-11 22:39:25,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:39:25,008 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1673 transitions. [2024-11-11 22:39:25,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 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-11 22:39:25,008 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1673 transitions. [2024-11-11 22:39:25,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-11 22:39:25,009 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:39:25,009 INFO L218 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] [2024-11-11 22:39:25,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:39:25,010 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:39:25,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:39:25,010 INFO L85 PathProgramCache]: Analyzing trace with hash 289436656, now seen corresponding path program 1 times [2024-11-11 22:39:25,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:39:25,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381138863] [2024-11-11 22:39:25,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:25,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:39:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:25,223 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-11 22:39:25,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:39:25,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381138863] [2024-11-11 22:39:25,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381138863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:39:25,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:39:25,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:39:25,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211741605] [2024-11-11 22:39:25,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:39:25,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:39:25,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:39:25,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:39:25,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:39:25,225 INFO L87 Difference]: Start difference. First operand 916 states and 1673 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-11 22:39:25,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:39:25,265 INFO L93 Difference]: Finished difference Result 924 states and 1682 transitions. [2024-11-11 22:39:25,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:39:25,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-11-11 22:39:25,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:39:25,271 INFO L225 Difference]: With dead ends: 924 [2024-11-11 22:39:25,271 INFO L226 Difference]: Without dead ends: 922 [2024-11-11 22:39:25,272 INFO L434 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-11 22:39:25,275 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 0 mSDsluCounter, 4566 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6091 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:39:25,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6091 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:39:25,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-11-11 22:39:25,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 922. [2024-11-11 22:39:25,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 920 states have (on average 1.8239130434782609) internal successors, (1678), 921 states have internal predecessors, (1678), 0 states have call successors, (0), 0 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-11 22:39:25,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1678 transitions. [2024-11-11 22:39:25,293 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1678 transitions. Word has length 47 [2024-11-11 22:39:25,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:39:25,294 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1678 transitions. [2024-11-11 22:39:25,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-11 22:39:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1678 transitions. [2024-11-11 22:39:25,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 22:39:25,295 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:39:25,296 INFO L218 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] [2024-11-11 22:39:25,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:39:25,296 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:39:25,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:39:25,297 INFO L85 PathProgramCache]: Analyzing trace with hash -2036800602, now seen corresponding path program 1 times [2024-11-11 22:39:25,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:39:25,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282959687] [2024-11-11 22:39:25,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:25,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:39:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:25,331 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-11 22:39:25,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:39:25,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282959687] [2024-11-11 22:39:25,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282959687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:39:25,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:39:25,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:39:25,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078319687] [2024-11-11 22:39:25,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:39:25,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:39:25,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:39:25,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:39:25,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:39:25,333 INFO L87 Difference]: Start difference. First operand 922 states and 1678 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 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-11 22:39:25,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:39:25,353 INFO L93 Difference]: Finished difference Result 1184 states and 2070 transitions. [2024-11-11 22:39:25,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:39:25,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-11-11 22:39:25,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:39:25,357 INFO L225 Difference]: With dead ends: 1184 [2024-11-11 22:39:25,357 INFO L226 Difference]: Without dead ends: 1045 [2024-11-11 22:39:25,358 INFO L434 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-11 22:39:25,358 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 1487 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1487 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:39:25,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1487 Valid, 1630 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:39:25,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2024-11-11 22:39:25,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1043. [2024-11-11 22:39:25,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 1041 states have (on average 1.781940441882805) internal successors, (1855), 1042 states have internal predecessors, (1855), 0 states have call successors, (0), 0 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-11 22:39:25,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1855 transitions. [2024-11-11 22:39:25,373 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1855 transitions. Word has length 48 [2024-11-11 22:39:25,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:39:25,373 INFO L471 AbstractCegarLoop]: Abstraction has 1043 states and 1855 transitions. [2024-11-11 22:39:25,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 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-11 22:39:25,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1855 transitions. [2024-11-11 22:39:25,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 22:39:25,373 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:39:25,374 INFO L218 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] [2024-11-11 22:39:25,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:39:25,374 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:39:25,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:39:25,374 INFO L85 PathProgramCache]: Analyzing trace with hash 42697894, now seen corresponding path program 1 times [2024-11-11 22:39:25,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:39:25,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039289243] [2024-11-11 22:39:25,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:25,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:39:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:25,415 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-11 22:39:25,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:39:25,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039289243] [2024-11-11 22:39:25,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039289243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:39:25,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:39:25,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:39:25,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21776592] [2024-11-11 22:39:25,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:39:25,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:39:25,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:39:25,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:39:25,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:39:25,417 INFO L87 Difference]: Start difference. First operand 1043 states and 1855 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 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-11 22:39:25,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:39:25,441 INFO L93 Difference]: Finished difference Result 1531 states and 2573 transitions. [2024-11-11 22:39:25,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:39:25,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-11-11 22:39:25,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:39:25,446 INFO L225 Difference]: With dead ends: 1531 [2024-11-11 22:39:25,447 INFO L226 Difference]: Without dead ends: 1271 [2024-11-11 22:39:25,447 INFO L434 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-11 22:39:25,448 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 1485 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:39:25,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 1632 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:39:25,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2024-11-11 22:39:25,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1269. [2024-11-11 22:39:25,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 1267 states have (on average 1.718232044198895) internal successors, (2177), 1268 states have internal predecessors, (2177), 0 states have call successors, (0), 0 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-11 22:39:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 2177 transitions. [2024-11-11 22:39:25,475 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 2177 transitions. Word has length 48 [2024-11-11 22:39:25,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:39:25,475 INFO L471 AbstractCegarLoop]: Abstraction has 1269 states and 2177 transitions. [2024-11-11 22:39:25,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 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-11 22:39:25,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 2177 transitions. [2024-11-11 22:39:25,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 22:39:25,476 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:39:25,476 INFO L218 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] [2024-11-11 22:39:25,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 22:39:25,476 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:39:25,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:39:25,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1823630758, now seen corresponding path program 1 times [2024-11-11 22:39:25,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:39:25,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314799900] [2024-11-11 22:39:25,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:25,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:39:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:25,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:39:25,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:39:25,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314799900] [2024-11-11 22:39:25,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314799900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:39:25,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:39:25,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:39:25,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801083166] [2024-11-11 22:39:25,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:39:25,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:39:25,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:39:25,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:39:25,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:39:25,515 INFO L87 Difference]: Start difference. First operand 1269 states and 2177 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 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-11 22:39:25,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:39:25,539 INFO L93 Difference]: Finished difference Result 2177 states and 3483 transitions. [2024-11-11 22:39:25,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:39:25,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-11-11 22:39:25,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:39:25,546 INFO L225 Difference]: With dead ends: 2177 [2024-11-11 22:39:25,546 INFO L226 Difference]: Without dead ends: 1691 [2024-11-11 22:39:25,547 INFO L434 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-11 22:39:25,548 INFO L435 NwaCegarLoop]: 1561 mSDtfsCounter, 1483 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:39:25,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 1634 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:39:25,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2024-11-11 22:39:25,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1689. [2024-11-11 22:39:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1689 states, 1687 states have (on average 1.6342620035566093) internal successors, (2757), 1688 states have internal predecessors, (2757), 0 states have call successors, (0), 0 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-11 22:39:25,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2757 transitions. [2024-11-11 22:39:25,580 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2757 transitions. Word has length 48 [2024-11-11 22:39:25,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:39:25,580 INFO L471 AbstractCegarLoop]: Abstraction has 1689 states and 2757 transitions. [2024-11-11 22:39:25,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 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-11 22:39:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2757 transitions. [2024-11-11 22:39:25,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-11 22:39:25,581 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:39:25,581 INFO L218 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] [2024-11-11 22:39:25,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:39:25,581 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:39:25,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:39:25,581 INFO L85 PathProgramCache]: Analyzing trace with hash 246335073, now seen corresponding path program 1 times [2024-11-11 22:39:25,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:39:25,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939060933] [2024-11-11 22:39:25,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:25,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:39:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:25,613 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-11 22:39:25,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:39:25,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939060933] [2024-11-11 22:39:25,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939060933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:39:25,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:39:25,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:39:25,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688553407] [2024-11-11 22:39:25,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:39:25,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:39:25,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:39:25,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:39:25,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:39:25,614 INFO L87 Difference]: Start difference. First operand 1689 states and 2757 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 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-11 22:39:25,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:39:25,646 INFO L93 Difference]: Finished difference Result 2656 states and 4155 transitions. [2024-11-11 22:39:25,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:39:25,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-11-11 22:39:25,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:39:25,652 INFO L225 Difference]: With dead ends: 2656 [2024-11-11 22:39:25,652 INFO L226 Difference]: Without dead ends: 2125 [2024-11-11 22:39:25,655 INFO L434 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-11 22:39:25,656 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 1486 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:39:25,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1631 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:39:25,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2024-11-11 22:39:25,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2123. [2024-11-11 22:39:25,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2123 states, 2121 states have (on average 1.5836869401225837) internal successors, (3359), 2122 states have internal predecessors, (3359), 0 states have call successors, (0), 0 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-11 22:39:25,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 3359 transitions. [2024-11-11 22:39:25,690 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 3359 transitions. Word has length 50 [2024-11-11 22:39:25,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:39:25,690 INFO L471 AbstractCegarLoop]: Abstraction has 2123 states and 3359 transitions. [2024-11-11 22:39:25,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 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-11 22:39:25,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3359 transitions. [2024-11-11 22:39:25,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 22:39:25,691 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:39:25,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:39:25,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:39:25,692 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:39:25,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:39:25,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1201090937, now seen corresponding path program 1 times [2024-11-11 22:39:25,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:39:25,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589086534] [2024-11-11 22:39:25,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:25,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:39:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:25,772 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-11 22:39:25,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:39:25,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589086534] [2024-11-11 22:39:25,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589086534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:39:25,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:39:25,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:39:25,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532629389] [2024-11-11 22:39:25,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:39:25,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:39:25,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:39:25,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:39:25,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:39:25,774 INFO L87 Difference]: Start difference. First operand 2123 states and 3359 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:39:30,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:39:30,540 INFO L93 Difference]: Finished difference Result 4378 states and 7668 transitions. [2024-11-11 22:39:30,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 22:39:30,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-11 22:39:30,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:39:30,553 INFO L225 Difference]: With dead ends: 4378 [2024-11-11 22:39:30,553 INFO L226 Difference]: Without dead ends: 3625 [2024-11-11 22:39:30,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:39:30,555 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 2365 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2365 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:39:30,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2365 Valid, 782 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-11 22:39:30,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3625 states. [2024-11-11 22:39:30,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3625 to 3625. [2024-11-11 22:39:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3625 states, 3623 states have (on average 1.5106265525807343) internal successors, (5473), 3624 states have internal predecessors, (5473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:39:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3625 states to 3625 states and 5473 transitions. [2024-11-11 22:39:30,633 INFO L78 Accepts]: Start accepts. Automaton has 3625 states and 5473 transitions. Word has length 63 [2024-11-11 22:39:30,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:39:30,633 INFO L471 AbstractCegarLoop]: Abstraction has 3625 states and 5473 transitions. [2024-11-11 22:39:30,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:39:30,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3625 states and 5473 transitions. [2024-11-11 22:39:30,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:39:30,634 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:39:30,634 INFO L218 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] [2024-11-11 22:39:30,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:39:30,635 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:39:30,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:39:30,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1523853909, now seen corresponding path program 1 times [2024-11-11 22:39:30,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:39:30,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534381155] [2024-11-11 22:39:30,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:30,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:39:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 22:39:30,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:39:30,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534381155] [2024-11-11 22:39:30,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534381155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:39:30,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:39:30,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:39:30,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661572207] [2024-11-11 22:39:30,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:39:30,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:39:30,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:39:30,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:39:30,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:39:30,752 INFO L87 Difference]: Start difference. First operand 3625 states and 5473 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:39:30,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:39:30,881 INFO L93 Difference]: Finished difference Result 9275 states and 13430 transitions. [2024-11-11 22:39:30,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:39:30,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-11 22:39:30,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:39:30,905 INFO L225 Difference]: With dead ends: 9275 [2024-11-11 22:39:30,905 INFO L226 Difference]: Without dead ends: 7937 [2024-11-11 22:39:30,913 INFO L434 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-11 22:39:30,913 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 4667 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4667 SdHoareTripleChecker+Valid, 3350 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:39:30,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4667 Valid, 3350 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:39:30,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7937 states. [2024-11-11 22:39:31,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7937 to 4961. [2024-11-11 22:39:31,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4961 states, 4959 states have (on average 1.4795321637426901) internal successors, (7337), 4960 states have internal predecessors, (7337), 0 states have call successors, (0), 0 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-11 22:39:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4961 states to 4961 states and 7337 transitions. [2024-11-11 22:39:31,044 INFO L78 Accepts]: Start accepts. Automaton has 4961 states and 7337 transitions. Word has length 65 [2024-11-11 22:39:31,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:39:31,044 INFO L471 AbstractCegarLoop]: Abstraction has 4961 states and 7337 transitions. [2024-11-11 22:39:31,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:39:31,044 INFO L276 IsEmpty]: Start isEmpty. Operand 4961 states and 7337 transitions. [2024-11-11 22:39:31,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:39:31,045 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:39:31,045 INFO L218 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] [2024-11-11 22:39:31,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 22:39:31,045 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:39:31,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:39:31,046 INFO L85 PathProgramCache]: Analyzing trace with hash 555644587, now seen corresponding path program 1 times [2024-11-11 22:39:31,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:39:31,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550631543] [2024-11-11 22:39:31,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:31,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:39:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:31,141 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 22:39:31,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:39:31,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550631543] [2024-11-11 22:39:31,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550631543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:39:31,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:39:31,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:39:31,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567747719] [2024-11-11 22:39:31,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:39:31,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:39:31,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:39:31,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:39:31,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:39:31,143 INFO L87 Difference]: Start difference. First operand 4961 states and 7337 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-11 22:39:31,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:39:31,324 INFO L93 Difference]: Finished difference Result 10611 states and 15294 transitions. [2024-11-11 22:39:31,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:39:31,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-11 22:39:31,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:39:31,344 INFO L225 Difference]: With dead ends: 10611 [2024-11-11 22:39:31,344 INFO L226 Difference]: Without dead ends: 9273 [2024-11-11 22:39:31,349 INFO L434 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-11 22:39:31,350 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 4692 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4692 SdHoareTripleChecker+Valid, 3303 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:39:31,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4692 Valid, 3303 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:39:31,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9273 states. [2024-11-11 22:39:31,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9273 to 6969. [2024-11-11 22:39:31,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6969 states, 6967 states have (on average 1.451557341753983) internal successors, (10113), 6968 states have internal predecessors, (10113), 0 states have call successors, (0), 0 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-11 22:39:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6969 states to 6969 states and 10113 transitions. [2024-11-11 22:39:31,507 INFO L78 Accepts]: Start accepts. Automaton has 6969 states and 10113 transitions. Word has length 65 [2024-11-11 22:39:31,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:39:31,507 INFO L471 AbstractCegarLoop]: Abstraction has 6969 states and 10113 transitions. [2024-11-11 22:39:31,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-11 22:39:31,510 INFO L276 IsEmpty]: Start isEmpty. Operand 6969 states and 10113 transitions. [2024-11-11 22:39:31,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:39:31,511 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:39:31,511 INFO L218 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] [2024-11-11 22:39:31,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 22:39:31,512 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:39:31,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:39:31,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1958389845, now seen corresponding path program 1 times [2024-11-11 22:39:31,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:39:31,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860942661] [2024-11-11 22:39:31,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:31,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:39:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:31,596 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 22:39:31,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:39:31,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860942661] [2024-11-11 22:39:31,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860942661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:39:31,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:39:31,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:39:31,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116305765] [2024-11-11 22:39:31,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:39:31,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:39:31,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:39:31,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:39:31,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:39:31,598 INFO L87 Difference]: Start difference. First operand 6969 states and 10113 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-11 22:39:31,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:39:31,764 INFO L93 Difference]: Finished difference Result 11947 states and 17158 transitions. [2024-11-11 22:39:31,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:39:31,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-11 22:39:31,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:39:31,781 INFO L225 Difference]: With dead ends: 11947 [2024-11-11 22:39:31,781 INFO L226 Difference]: Without dead ends: 10609 [2024-11-11 22:39:31,786 INFO L434 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-11 22:39:31,786 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 4673 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4673 SdHoareTripleChecker+Valid, 3337 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:39:31,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4673 Valid, 3337 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:39:31,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10609 states. [2024-11-11 22:39:31,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10609 to 8305. [2024-11-11 22:39:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8305 states, 8303 states have (on average 1.4424906660243286) internal successors, (11977), 8304 states have internal predecessors, (11977), 0 states have call successors, (0), 0 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-11 22:39:31,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8305 states to 8305 states and 11977 transitions. [2024-11-11 22:39:31,932 INFO L78 Accepts]: Start accepts. Automaton has 8305 states and 11977 transitions. Word has length 65 [2024-11-11 22:39:31,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:39:31,932 INFO L471 AbstractCegarLoop]: Abstraction has 8305 states and 11977 transitions. [2024-11-11 22:39:31,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-11 22:39:31,932 INFO L276 IsEmpty]: Start isEmpty. Operand 8305 states and 11977 transitions. [2024-11-11 22:39:31,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 22:39:31,933 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:39:31,933 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:39:31,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 22:39:31,934 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:39:31,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:39:31,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1188964029, now seen corresponding path program 1 times [2024-11-11 22:39:31,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:39:31,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643131733] [2024-11-11 22:39:31,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:31,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:39:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:31,998 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-11 22:39:31,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:39:31,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643131733] [2024-11-11 22:39:31,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643131733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:39:31,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:39:31,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:39:31,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103479817] [2024-11-11 22:39:31,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:39:31,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:39:32,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:39:32,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:39:32,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:39:32,000 INFO L87 Difference]: Start difference. First operand 8305 states and 11977 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:39:32,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:39:32,066 INFO L93 Difference]: Finished difference Result 12647 states and 18118 transitions. [2024-11-11 22:39:32,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:39:32,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-11 22:39:32,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:39:32,077 INFO L225 Difference]: With dead ends: 12647 [2024-11-11 22:39:32,077 INFO L226 Difference]: Without dead ends: 6629 [2024-11-11 22:39:32,084 INFO L434 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-11 22:39:32,084 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 42 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3073 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:39:32,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3073 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:39:32,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6629 states. [2024-11-11 22:39:32,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6629 to 6627. [2024-11-11 22:39:32,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6627 states, 6625 states have (on average 1.4567547169811321) internal successors, (9651), 6626 states have internal predecessors, (9651), 0 states have call successors, (0), 0 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-11 22:39:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6627 states to 6627 states and 9651 transitions. [2024-11-11 22:39:32,221 INFO L78 Accepts]: Start accepts. Automaton has 6627 states and 9651 transitions. Word has length 67 [2024-11-11 22:39:32,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:39:32,222 INFO L471 AbstractCegarLoop]: Abstraction has 6627 states and 9651 transitions. [2024-11-11 22:39:32,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:39:32,222 INFO L276 IsEmpty]: Start isEmpty. Operand 6627 states and 9651 transitions. [2024-11-11 22:39:32,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 22:39:32,223 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:39:32,223 INFO L218 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] [2024-11-11 22:39:32,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 22:39:32,223 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:39:32,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:39:32,223 INFO L85 PathProgramCache]: Analyzing trace with hash -733131994, now seen corresponding path program 1 times [2024-11-11 22:39:32,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:39:32,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812109660] [2024-11-11 22:39:32,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:32,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:39:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:32,314 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-11 22:39:32,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:39:32,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812109660] [2024-11-11 22:39:32,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812109660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:39:32,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:39:32,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:39:32,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67681389] [2024-11-11 22:39:32,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:39:32,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:39:32,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:39:32,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:39:32,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:39:32,317 INFO L87 Difference]: Start difference. First operand 6627 states and 9651 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:39:32,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:39:32,475 INFO L93 Difference]: Finished difference Result 10477 states and 15096 transitions. [2024-11-11 22:39:32,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:39:32,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-11 22:39:32,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:39:32,490 INFO L225 Difference]: With dead ends: 10477 [2024-11-11 22:39:32,491 INFO L226 Difference]: Without dead ends: 9515 [2024-11-11 22:39:32,495 INFO L434 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-11 22:39:32,496 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 4665 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4665 SdHoareTripleChecker+Valid, 3404 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:39:32,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4665 Valid, 3404 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:39:32,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9515 states. [2024-11-11 22:39:32,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9515 to 7587. [2024-11-11 22:39:32,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7587 states, 7585 states have (on average 1.4495715227422545) internal successors, (10995), 7586 states have internal predecessors, (10995), 0 states have call successors, (0), 0 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-11 22:39:32,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7587 states to 7587 states and 10995 transitions. [2024-11-11 22:39:32,627 INFO L78 Accepts]: Start accepts. Automaton has 7587 states and 10995 transitions. Word has length 67 [2024-11-11 22:39:32,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:39:32,628 INFO L471 AbstractCegarLoop]: Abstraction has 7587 states and 10995 transitions. [2024-11-11 22:39:32,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:39:32,628 INFO L276 IsEmpty]: Start isEmpty. Operand 7587 states and 10995 transitions. [2024-11-11 22:39:32,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 22:39:32,629 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:39:32,629 INFO L218 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] [2024-11-11 22:39:32,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 22:39:32,629 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:39:32,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:39:32,629 INFO L85 PathProgramCache]: Analyzing trace with hash 548136257, now seen corresponding path program 1 times [2024-11-11 22:39:32,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:39:32,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715641238] [2024-11-11 22:39:32,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:32,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:39:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:32,689 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-11 22:39:32,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:39:32,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715641238] [2024-11-11 22:39:32,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715641238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:39:32,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:39:32,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:39:32,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979850154] [2024-11-11 22:39:32,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:39:32,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:39:32,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:39:32,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:39:32,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:39:32,691 INFO L87 Difference]: Start difference. First operand 7587 states and 10995 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:39:32,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:39:32,742 INFO L93 Difference]: Finished difference Result 10231 states and 14693 transitions. [2024-11-11 22:39:32,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:39:32,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-11 22:39:32,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:39:32,750 INFO L225 Difference]: With dead ends: 10231 [2024-11-11 22:39:32,750 INFO L226 Difference]: Without dead ends: 4949 [2024-11-11 22:39:32,755 INFO L434 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-11 22:39:32,756 INFO L435 NwaCegarLoop]: 1553 mSDtfsCounter, 37 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3058 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:39:32,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3058 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:39:32,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4949 states. [2024-11-11 22:39:32,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4949 to 4947. [2024-11-11 22:39:32,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4947 states, 4945 states have (on average 1.4671385237613752) internal successors, (7255), 4946 states have internal predecessors, (7255), 0 states have call successors, (0), 0 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-11 22:39:32,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4947 states to 4947 states and 7255 transitions. [2024-11-11 22:39:32,827 INFO L78 Accepts]: Start accepts. Automaton has 4947 states and 7255 transitions. Word has length 68 [2024-11-11 22:39:32,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:39:32,827 INFO L471 AbstractCegarLoop]: Abstraction has 4947 states and 7255 transitions. [2024-11-11 22:39:32,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:39:32,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4947 states and 7255 transitions. [2024-11-11 22:39:32,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-11 22:39:32,828 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:39:32,829 INFO L218 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] [2024-11-11 22:39:32,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 22:39:32,829 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:39:32,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:39:32,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1967598547, now seen corresponding path program 1 times [2024-11-11 22:39:32,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:39:32,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490725617] [2024-11-11 22:39:32,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:32,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:39:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:32,892 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-11 22:39:32,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:39:32,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490725617] [2024-11-11 22:39:32,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490725617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:39:32,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:39:32,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:39:32,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529421792] [2024-11-11 22:39:32,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:39:32,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:39:32,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:39:32,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:39:32,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:39:32,894 INFO L87 Difference]: Start difference. First operand 4947 states and 7255 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:39:32,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:39:32,964 INFO L93 Difference]: Finished difference Result 6271 states and 9083 transitions. [2024-11-11 22:39:32,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:39:32,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-11 22:39:32,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:39:32,969 INFO L225 Difference]: With dead ends: 6271 [2024-11-11 22:39:32,970 INFO L226 Difference]: Without dead ends: 3629 [2024-11-11 22:39:32,972 INFO L434 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-11 22:39:32,972 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 34 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3043 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:39:32,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3043 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:39:32,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3629 states. [2024-11-11 22:39:33,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3629 to 3627. [2024-11-11 22:39:33,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3627 states, 3625 states have (on average 1.4915862068965517) internal successors, (5407), 3626 states have internal predecessors, (5407), 0 states have call successors, (0), 0 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-11 22:39:33,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3627 states to 3627 states and 5407 transitions. [2024-11-11 22:39:33,040 INFO L78 Accepts]: Start accepts. Automaton has 3627 states and 5407 transitions. Word has length 70 [2024-11-11 22:39:33,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:39:33,041 INFO L471 AbstractCegarLoop]: Abstraction has 3627 states and 5407 transitions. [2024-11-11 22:39:33,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:39:33,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3627 states and 5407 transitions. [2024-11-11 22:39:33,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-11 22:39:33,042 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:39:33,042 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:39:33,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 22:39:33,042 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:39:33,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:39:33,043 INFO L85 PathProgramCache]: Analyzing trace with hash -673918747, now seen corresponding path program 1 times [2024-11-11 22:39:33,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:39:33,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15171858] [2024-11-11 22:39:33,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:33,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:39:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:33,114 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-11 22:39:33,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:39:33,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15171858] [2024-11-11 22:39:33,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15171858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:39:33,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:39:33,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:39:33,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891284022] [2024-11-11 22:39:33,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:39:33,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:39:33,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:39:33,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:39:33,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:39:33,116 INFO L87 Difference]: Start difference. First operand 3627 states and 5407 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:39:33,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:39:33,153 INFO L93 Difference]: Finished difference Result 4291 states and 6311 transitions. [2024-11-11 22:39:33,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:39:33,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-11 22:39:33,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:39:33,159 INFO L225 Difference]: With dead ends: 4291 [2024-11-11 22:39:33,159 INFO L226 Difference]: Without dead ends: 2969 [2024-11-11 22:39:33,161 INFO L434 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-11 22:39:33,161 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 31 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3028 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:39:33,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3028 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:39:33,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2024-11-11 22:39:33,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 2967. [2024-11-11 22:39:33,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2967 states, 2965 states have (on average 1.5156829679595278) internal successors, (4494), 2966 states have internal predecessors, (4494), 0 states have call successors, (0), 0 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-11 22:39:33,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2967 states and 4494 transitions. [2024-11-11 22:39:33,211 INFO L78 Accepts]: Start accepts. Automaton has 2967 states and 4494 transitions. Word has length 72 [2024-11-11 22:39:33,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:39:33,211 INFO L471 AbstractCegarLoop]: Abstraction has 2967 states and 4494 transitions. [2024-11-11 22:39:33,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:39:33,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2967 states and 4494 transitions. [2024-11-11 22:39:33,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 22:39:33,212 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:39:33,212 INFO L218 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] [2024-11-11 22:39:33,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 22:39:33,213 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:39:33,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:39:33,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1516893303, now seen corresponding path program 1 times [2024-11-11 22:39:33,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:39:33,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558252005] [2024-11-11 22:39:33,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:33,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:39:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:39:34,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:39:34,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558252005] [2024-11-11 22:39:34,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558252005] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:39:34,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56420207] [2024-11-11 22:39:34,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:34,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:39:34,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:39:34,353 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-11 22:39:34,353 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-11 22:39:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:34,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-11 22:39:34,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:39:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:39:34,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:39:35,546 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:39:35,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56420207] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:39:35,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:39:35,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2024-11-11 22:39:35,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878885237] [2024-11-11 22:39:35,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:39:35,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-11 22:39:35,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:39:35,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-11 22:39:35,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2024-11-11 22:39:35,548 INFO L87 Difference]: Start difference. First operand 2967 states and 4494 transitions. Second operand has 28 states, 28 states have (on average 6.714285714285714) internal successors, (188), 27 states have internal predecessors, (188), 0 states have call successors, (0), 0 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-11 22:39:37,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:39:37,746 INFO L93 Difference]: Finished difference Result 5331 states and 7678 transitions. [2024-11-11 22:39:37,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-11 22:39:37,747 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.714285714285714) internal successors, (188), 27 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-11 22:39:37,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:39:37,754 INFO L225 Difference]: With dead ends: 5331 [2024-11-11 22:39:37,754 INFO L226 Difference]: Without dead ends: 4669 [2024-11-11 22:39:37,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=858, Invalid=3174, Unknown=0, NotChecked=0, Total=4032 [2024-11-11 22:39:37,758 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 29613 mSDsluCounter, 4863 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29613 SdHoareTripleChecker+Valid, 6356 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:39:37,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29613 Valid, 6356 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:39:37,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2024-11-11 22:39:37,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4606. [2024-11-11 22:39:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4606 states, 4604 states have (on average 1.4443961772371852) internal successors, (6650), 4605 states have internal predecessors, (6650), 0 states have call successors, (0), 0 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-11 22:39:37,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4606 states to 4606 states and 6650 transitions. [2024-11-11 22:39:37,893 INFO L78 Accepts]: Start accepts. Automaton has 4606 states and 6650 transitions. Word has length 74 [2024-11-11 22:39:37,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:39:37,893 INFO L471 AbstractCegarLoop]: Abstraction has 4606 states and 6650 transitions. [2024-11-11 22:39:37,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.714285714285714) internal successors, (188), 27 states have internal predecessors, (188), 0 states have call successors, (0), 0 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-11 22:39:37,893 INFO L276 IsEmpty]: Start isEmpty. Operand 4606 states and 6650 transitions. [2024-11-11 22:39:37,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-11 22:39:37,895 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:39:37,895 INFO L218 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] [2024-11-11 22:39:37,912 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-11 22:39:38,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:39:38,100 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:39:38,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:39:38,101 INFO L85 PathProgramCache]: Analyzing trace with hash 217982714, now seen corresponding path program 1 times [2024-11-11 22:39:38,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:39:38,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334378347] [2024-11-11 22:39:38,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:38,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:39:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:38,424 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:39:38,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:39:38,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334378347] [2024-11-11 22:39:38,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334378347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:39:38,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927227370] [2024-11-11 22:39:38,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:38,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:39:38,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:39:38,425 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-11 22:39:38,426 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-11 22:39:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:38,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-11 22:39:38,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:39:38,805 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-11 22:39:38,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:39:39,348 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-11 22:39:39,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927227370] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:39:39,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:39:39,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-11 22:39:39,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852248108] [2024-11-11 22:39:39,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:39:39,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-11 22:39:39,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:39:39,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-11 22:39:39,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2024-11-11 22:39:39,350 INFO L87 Difference]: Start difference. First operand 4606 states and 6650 transitions. Second operand has 25 states, 25 states have (on average 8.36) internal successors, (209), 24 states have internal predecessors, (209), 0 states have call successors, (0), 0 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-11 22:39:40,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:39:40,366 INFO L93 Difference]: Finished difference Result 11183 states and 15455 transitions. [2024-11-11 22:39:40,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-11 22:39:40,367 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.36) internal successors, (209), 24 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-11 22:39:40,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:39:40,379 INFO L225 Difference]: With dead ends: 11183 [2024-11-11 22:39:40,379 INFO L226 Difference]: Without dead ends: 8882 [2024-11-11 22:39:40,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=457, Invalid=1613, Unknown=0, NotChecked=0, Total=2070 [2024-11-11 22:39:40,384 INFO L435 NwaCegarLoop]: 1494 mSDtfsCounter, 16933 mSDsluCounter, 6330 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16933 SdHoareTripleChecker+Valid, 7824 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:39:40,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16933 Valid, 7824 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 22:39:40,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8882 states. [2024-11-11 22:39:40,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8882 to 8841. [2024-11-11 22:39:40,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8841 states, 8839 states have (on average 1.3808123090847382) internal successors, (12205), 8840 states have internal predecessors, (12205), 0 states have call successors, (0), 0 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-11 22:39:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 12205 transitions. [2024-11-11 22:39:40,554 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 12205 transitions. Word has length 75 [2024-11-11 22:39:40,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:39:40,555 INFO L471 AbstractCegarLoop]: Abstraction has 8841 states and 12205 transitions. [2024-11-11 22:39:40,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.36) internal successors, (209), 24 states have internal predecessors, (209), 0 states have call successors, (0), 0 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-11 22:39:40,555 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 12205 transitions. [2024-11-11 22:39:40,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-11 22:39:40,556 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:39:40,556 INFO L218 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] [2024-11-11 22:39:40,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 22:39:40,756 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,SelfDestructingSolverStorable20 [2024-11-11 22:39:40,757 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:39:40,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:39:40,757 INFO L85 PathProgramCache]: Analyzing trace with hash -268185879, now seen corresponding path program 1 times [2024-11-11 22:39:40,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:39:40,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586364907] [2024-11-11 22:39:40,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:40,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:39:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:41,012 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-11 22:39:41,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:39:41,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586364907] [2024-11-11 22:39:41,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586364907] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:39:41,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504698771] [2024-11-11 22:39:41,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:41,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:39:41,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:39:41,016 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-11 22:39:41,017 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-11 22:39:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:41,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-11 22:39:41,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:39:41,576 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-11 22:39:41,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:39:42,307 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-11 22:39:42,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504698771] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:39:42,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:39:42,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 28 [2024-11-11 22:39:42,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478890849] [2024-11-11 22:39:42,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:39:42,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-11 22:39:42,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:39:42,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-11 22:39:42,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2024-11-11 22:39:42,309 INFO L87 Difference]: Start difference. First operand 8841 states and 12205 transitions. Second operand has 28 states, 28 states have (on average 7.0) internal successors, (196), 28 states have internal predecessors, (196), 0 states have call successors, (0), 0 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-11 22:39:43,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:39:43,018 INFO L93 Difference]: Finished difference Result 20518 states and 27641 transitions. [2024-11-11 22:39:43,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 22:39:43,019 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 7.0) internal successors, (196), 28 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-11 22:39:43,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:39:43,037 INFO L225 Difference]: With dead ends: 20518 [2024-11-11 22:39:43,038 INFO L226 Difference]: Without dead ends: 13982 [2024-11-11 22:39:43,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=1209, Unknown=0, NotChecked=0, Total=1560 [2024-11-11 22:39:43,047 INFO L435 NwaCegarLoop]: 1517 mSDtfsCounter, 13346 mSDsluCounter, 7946 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13346 SdHoareTripleChecker+Valid, 9463 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:39:43,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13346 Valid, 9463 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 22:39:43,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13982 states. [2024-11-11 22:39:43,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13982 to 13340. [2024-11-11 22:39:43,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13340 states, 13338 states have (on average 1.3480281901334532) internal successors, (17980), 13339 states have internal predecessors, (17980), 0 states have call successors, (0), 0 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-11 22:39:43,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13340 states to 13340 states and 17980 transitions. [2024-11-11 22:39:43,364 INFO L78 Accepts]: Start accepts. Automaton has 13340 states and 17980 transitions. Word has length 76 [2024-11-11 22:39:43,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:39:43,365 INFO L471 AbstractCegarLoop]: Abstraction has 13340 states and 17980 transitions. [2024-11-11 22:39:43,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.0) internal successors, (196), 28 states have internal predecessors, (196), 0 states have call successors, (0), 0 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-11 22:39:43,365 INFO L276 IsEmpty]: Start isEmpty. Operand 13340 states and 17980 transitions. [2024-11-11 22:39:43,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 22:39:43,367 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:39:43,367 INFO L218 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] [2024-11-11 22:39:43,386 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-11 22:39:43,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:39:43,568 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:39:43,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:39:43,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1113650506, now seen corresponding path program 1 times [2024-11-11 22:39:43,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:39:43,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375150765] [2024-11-11 22:39:43,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:43,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:39:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:44,619 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-11 22:39:44,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:39:44,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375150765] [2024-11-11 22:39:44,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375150765] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:39:44,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283506658] [2024-11-11 22:39:44,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:39:44,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:39:44,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:39:44,621 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:39:44,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 22:39:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:39:44,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-11 22:39:44,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:39:59,351 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-11 22:39:59,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:40:03,361 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-11 22:40:03,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283506658] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:40:03,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:40:03,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25, 23] total 60 [2024-11-11 22:40:03,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895816150] [2024-11-11 22:40:03,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:40:03,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-11-11 22:40:03,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:40:03,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-11-11 22:40:03,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=3181, Unknown=1, NotChecked=0, Total=3540 [2024-11-11 22:40:03,364 INFO L87 Difference]: Start difference. First operand 13340 states and 17980 transitions. Second operand has 60 states, 60 states have (on average 3.4833333333333334) internal successors, (209), 60 states have internal predecessors, (209), 0 states have call successors, (0), 0 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-11 22:40:12,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-11 22:40:18,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-11 22:40:31,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-11 22:40:33,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-11 22:40:37,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0]