./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label03.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 eac7eb39c98aff4ef80806ab78ab5db437ac2c7b09e47bea802a0bba118466ba --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:42:30,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:42:30,427 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:42:30,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:42:30,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:42:30,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:42:30,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:42:30,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:42:30,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:42:30,493 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:42:30,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:42:30,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:42:30,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:42:30,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:42:30,495 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:42:30,496 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:42:30,496 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:42:30,496 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:42:30,497 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:42:30,497 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:42:30,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:42:30,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:42:30,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:42:30,501 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:42:30,501 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:42:30,501 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:42:30,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:42:30,502 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:42:30,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:42:30,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:42:30,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:42:30,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:42:30,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:42:30,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:42:30,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:42:30,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:42:30,504 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:42:30,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:42:30,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:42:30,505 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:42:30,505 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:42:30,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:42:30,506 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-clean/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-clean/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 -> eac7eb39c98aff4ef80806ab78ab5db437ac2c7b09e47bea802a0bba118466ba [2024-10-11 04:42:30,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:42:30,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:42:30,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:42:30,766 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:42:30,766 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:42:30,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label03.c [2024-10-11 04:42:32,275 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:42:32,727 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:42:32,727 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label03.c [2024-10-11 04:42:32,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7bf24589a/345eda4f45a44c76b463d73c6854b67d/FLAG2add686c2 [2024-10-11 04:42:32,860 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7bf24589a/345eda4f45a44c76b463d73c6854b67d [2024-10-11 04:42:32,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:42:32,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:42:32,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:42:32,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:42:32,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:42:32,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:42:32" (1/1) ... [2024-10-11 04:42:32,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d8dbf80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:32, skipping insertion in model container [2024-10-11 04:42:32,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:42:32" (1/1) ... [2024-10-11 04:42:32,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:42:33,294 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label03.c[6450,6463] [2024-10-11 04:42:33,338 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label03.c[8787,8800] [2024-10-11 04:42:34,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:42:34,073 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:42:34,109 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label03.c[6450,6463] [2024-10-11 04:42:34,117 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label03.c[8787,8800] [2024-10-11 04:42:34,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:42:34,518 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:42:34,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:34 WrapperNode [2024-10-11 04:42:34,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:42:34,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:42:34,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:42:34,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:42:34,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:34" (1/1) ... [2024-10-11 04:42:34,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:34" (1/1) ... [2024-10-11 04:42:34,926 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4983 [2024-10-11 04:42:34,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:42:34,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:42:34,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:42:34,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:42:34,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:34" (1/1) ... [2024-10-11 04:42:34,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:34" (1/1) ... [2024-10-11 04:42:35,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:34" (1/1) ... [2024-10-11 04:42:35,195 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 04:42:35,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:34" (1/1) ... [2024-10-11 04:42:35,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:34" (1/1) ... [2024-10-11 04:42:35,304 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:34" (1/1) ... [2024-10-11 04:42:35,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:34" (1/1) ... [2024-10-11 04:42:35,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:34" (1/1) ... [2024-10-11 04:42:35,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:34" (1/1) ... [2024-10-11 04:42:35,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:42:35,512 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:42:35,512 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:42:35,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:42:35,514 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:34" (1/1) ... [2024-10-11 04:42:35,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:42:35,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:42:35,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:42:35,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:42:35,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:42:35,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:42:35,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:42:35,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:42:35,724 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:42:35,727 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:42:40,122 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2024-10-11 04:42:40,122 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:42:40,188 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:42:40,189 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 04:42:40,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:42:40 BoogieIcfgContainer [2024-10-11 04:42:40,190 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:42:40,192 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:42:40,193 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:42:40,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:42:40,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:42:32" (1/3) ... [2024-10-11 04:42:40,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eca3c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:42:40, skipping insertion in model container [2024-10-11 04:42:40,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:42:34" (2/3) ... [2024-10-11 04:42:40,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eca3c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:42:40, skipping insertion in model container [2024-10-11 04:42:40,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:42:40" (3/3) ... [2024-10-11 04:42:40,200 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label03.c [2024-10-11 04:42:40,219 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:42:40,219 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:42:40,335 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:42:40,342 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;@5f0c59e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:42:40,343 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:42:40,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 809 states, 806 states have (on average 1.978908188585608) internal successors, (1595), 808 states have internal predecessors, (1595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:40,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 04:42:40,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:40,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:42:40,363 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:40,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:40,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2106045877, now seen corresponding path program 1 times [2024-10-11 04:42:40,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:40,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435945021] [2024-10-11 04:42:40,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:40,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:40,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:40,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:40,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435945021] [2024-10-11 04:42:40,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435945021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:40,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:40,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:42:40,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184748160] [2024-10-11 04:42:40,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:40,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 04:42:40,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:40,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 04:42:40,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:42:40,650 INFO L87 Difference]: Start difference. First operand has 809 states, 806 states have (on average 1.978908188585608) internal successors, (1595), 808 states have internal predecessors, (1595), 0 states have call successors, (0), 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 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:40,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:40,741 INFO L93 Difference]: Finished difference Result 1597 states and 3151 transitions. [2024-10-11 04:42:40,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 04:42:40,744 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-10-11 04:42:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:40,769 INFO L225 Difference]: With dead ends: 1597 [2024-10-11 04:42:40,769 INFO L226 Difference]: Without dead ends: 805 [2024-10-11 04:42:40,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:42:40,778 INFO L432 NwaCegarLoop]: 1523 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:40,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1523 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:40,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-10-11 04:42:40,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2024-10-11 04:42:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 803 states have (on average 1.8978829389788294) internal successors, (1524), 804 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:40,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1524 transitions. [2024-10-11 04:42:40,859 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1524 transitions. Word has length 17 [2024-10-11 04:42:40,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:40,860 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1524 transitions. [2024-10-11 04:42:40,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:40,860 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1524 transitions. [2024-10-11 04:42:40,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 04:42:40,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:40,863 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:42:40,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:42:40,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:40,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:40,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1602115405, now seen corresponding path program 1 times [2024-10-11 04:42:40,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:40,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13419894] [2024-10-11 04:42:40,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:40,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:41,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:41,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:41,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13419894] [2024-10-11 04:42:41,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13419894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:41,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:41,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:42:41,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464388271] [2024-10-11 04:42:41,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:41,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:42:41,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:41,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:42:41,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:42:41,125 INFO L87 Difference]: Start difference. First operand 805 states and 1524 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:41,212 INFO L93 Difference]: Finished difference Result 839 states and 1576 transitions. [2024-10-11 04:42:41,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:42:41,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-10-11 04:42:41,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:41,217 INFO L225 Difference]: With dead ends: 839 [2024-10-11 04:42:41,217 INFO L226 Difference]: Without dead ends: 805 [2024-10-11 04:42:41,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:42:41,219 INFO L432 NwaCegarLoop]: 1521 mSDtfsCounter, 0 mSDsluCounter, 3022 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4543 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:41,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4543 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:41,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-10-11 04:42:41,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2024-10-11 04:42:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 803 states have (on average 1.8779576587795765) internal successors, (1508), 804 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1508 transitions. [2024-10-11 04:42:41,244 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1508 transitions. Word has length 17 [2024-10-11 04:42:41,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:41,245 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1508 transitions. [2024-10-11 04:42:41,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:41,245 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1508 transitions. [2024-10-11 04:42:41,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 04:42:41,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:41,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:42:41,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:42:41,246 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:41,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:41,247 INFO L85 PathProgramCache]: Analyzing trace with hash -2003021176, now seen corresponding path program 1 times [2024-10-11 04:42:41,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:41,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838263339] [2024-10-11 04:42:41,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:41,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:41,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:41,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838263339] [2024-10-11 04:42:41,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838263339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:41,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:41,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:42:41,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982397290] [2024-10-11 04:42:41,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:41,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:41,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:41,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:41,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:41,338 INFO L87 Difference]: Start difference. First operand 805 states and 1508 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:44,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:44,818 INFO L93 Difference]: Finished difference Result 2309 states and 4381 transitions. [2024-10-11 04:42:44,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:44,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-11 04:42:44,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:44,826 INFO L225 Difference]: With dead ends: 2309 [2024-10-11 04:42:44,826 INFO L226 Difference]: Without dead ends: 1556 [2024-10-11 04:42:44,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:44,829 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 919 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 3091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:44,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 181 Invalid, 3091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 04:42:44,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2024-10-11 04:42:44,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1556. [2024-10-11 04:42:44,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1554 states have (on average 1.832046332046332) internal successors, (2847), 1555 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:44,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2847 transitions. [2024-10-11 04:42:44,869 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2847 transitions. Word has length 19 [2024-10-11 04:42:44,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:44,870 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2847 transitions. [2024-10-11 04:42:44,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:44,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2847 transitions. [2024-10-11 04:42:44,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 04:42:44,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:44,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:42:44,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:42:44,872 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:44,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:44,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1530211809, now seen corresponding path program 1 times [2024-10-11 04:42:44,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:44,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789893296] [2024-10-11 04:42:44,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:44,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:45,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:45,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:45,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789893296] [2024-10-11 04:42:45,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789893296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:45,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:45,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:42:45,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50228055] [2024-10-11 04:42:45,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:45,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:42:45,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:45,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:42:45,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:42:45,047 INFO L87 Difference]: Start difference. First operand 1556 states and 2847 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:45,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:45,182 INFO L93 Difference]: Finished difference Result 1742 states and 3141 transitions. [2024-10-11 04:42:45,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:42:45,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-10-11 04:42:45,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:45,191 INFO L225 Difference]: With dead ends: 1742 [2024-10-11 04:42:45,191 INFO L226 Difference]: Without dead ends: 1711 [2024-10-11 04:42:45,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:42:45,193 INFO L432 NwaCegarLoop]: 1499 mSDtfsCounter, 4669 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4669 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:45,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4669 Valid, 1742 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:42:45,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2024-10-11 04:42:45,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1585. [2024-10-11 04:42:45,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1583 states have (on average 1.8275426405559065) internal successors, (2893), 1584 states have internal predecessors, (2893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:45,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2893 transitions. [2024-10-11 04:42:45,233 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2893 transitions. Word has length 32 [2024-10-11 04:42:45,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:45,234 INFO L471 AbstractCegarLoop]: Abstraction has 1585 states and 2893 transitions. [2024-10-11 04:42:45,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:45,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2893 transitions. [2024-10-11 04:42:45,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 04:42:45,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:45,236 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:42:45,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:42:45,236 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:45,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:45,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1777423345, now seen corresponding path program 1 times [2024-10-11 04:42:45,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:45,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250944011] [2024-10-11 04:42:45,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:45,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:45,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-10-11 04:42:45,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:45,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250944011] [2024-10-11 04:42:45,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250944011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:45,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:45,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:42:45,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452170896] [2024-10-11 04:42:45,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:45,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:45,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:45,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:45,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:45,337 INFO L87 Difference]: Start difference. First operand 1585 states and 2893 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:45,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:45,383 INFO L93 Difference]: Finished difference Result 1694 states and 3064 transitions. [2024-10-11 04:42:45,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:45,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-11 04:42:45,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:45,391 INFO L225 Difference]: With dead ends: 1694 [2024-10-11 04:42:45,391 INFO L226 Difference]: Without dead ends: 1634 [2024-10-11 04:42:45,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:45,393 INFO L432 NwaCegarLoop]: 1501 mSDtfsCounter, 1466 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:45,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 1542 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:45,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-10-11 04:42:45,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1630. [2024-10-11 04:42:45,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1628 states have (on average 1.8187960687960687) internal successors, (2961), 1629 states have internal predecessors, (2961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:45,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2961 transitions. [2024-10-11 04:42:45,435 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2961 transitions. Word has length 34 [2024-10-11 04:42:45,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:45,436 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2961 transitions. [2024-10-11 04:42:45,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:45,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2961 transitions. [2024-10-11 04:42:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 04:42:45,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:45,438 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:42:45,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:42:45,438 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:45,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:45,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1775278393, now seen corresponding path program 1 times [2024-10-11 04:42:45,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:45,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106894376] [2024-10-11 04:42:45,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:45,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:45,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:45,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:45,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106894376] [2024-10-11 04:42:45,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106894376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:45,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:45,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:42:45,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066707704] [2024-10-11 04:42:45,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:45,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:42:45,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:45,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:42:45,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:42:45,653 INFO L87 Difference]: Start difference. First operand 1630 states and 2961 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:45,743 INFO L93 Difference]: Finished difference Result 1737 states and 3125 transitions. [2024-10-11 04:42:45,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:42:45,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-11 04:42:45,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:45,753 INFO L225 Difference]: With dead ends: 1737 [2024-10-11 04:42:45,753 INFO L226 Difference]: Without dead ends: 1632 [2024-10-11 04:42:45,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:42:45,755 INFO L432 NwaCegarLoop]: 1500 mSDtfsCounter, 1476 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:45,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1632 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:45,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2024-10-11 04:42:45,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1630. [2024-10-11 04:42:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1628 states have (on average 1.8175675675675675) internal successors, (2959), 1629 states have internal predecessors, (2959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:45,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2959 transitions. [2024-10-11 04:42:45,796 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2959 transitions. Word has length 34 [2024-10-11 04:42:45,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:45,796 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2959 transitions. [2024-10-11 04:42:45,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:45,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2959 transitions. [2024-10-11 04:42:45,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 04:42:45,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:45,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:42:45,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:42:45,798 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:45,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:45,799 INFO L85 PathProgramCache]: Analyzing trace with hash 672589841, now seen corresponding path program 1 times [2024-10-11 04:42:45,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:45,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576009698] [2024-10-11 04:42:45,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:45,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:45,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:45,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:45,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576009698] [2024-10-11 04:42:45,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576009698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:45,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:45,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:42:45,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540894923] [2024-10-11 04:42:45,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:45,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:42:45,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:45,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:42:45,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:42:45,922 INFO L87 Difference]: Start difference. First operand 1630 states and 2959 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:45,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:45,962 INFO L93 Difference]: Finished difference Result 1636 states and 2966 transitions. [2024-10-11 04:42:45,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:42:45,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-11 04:42:45,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:45,969 INFO L225 Difference]: With dead ends: 1636 [2024-10-11 04:42:45,970 INFO L226 Difference]: Without dead ends: 1634 [2024-10-11 04:42:45,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:42:45,972 INFO L432 NwaCegarLoop]: 1504 mSDtfsCounter, 0 mSDsluCounter, 3000 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4504 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:45,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4504 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:45,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-10-11 04:42:46,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2024-10-11 04:42:46,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1632 states have (on average 1.8149509803921569) internal successors, (2962), 1633 states have internal predecessors, (2962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:46,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2962 transitions. [2024-10-11 04:42:46,010 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2962 transitions. Word has length 35 [2024-10-11 04:42:46,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:46,010 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2962 transitions. [2024-10-11 04:42:46,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:46,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2962 transitions. [2024-10-11 04:42:46,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:42:46,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:46,012 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:42:46,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:42:46,012 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:46,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:46,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1662874585, now seen corresponding path program 1 times [2024-10-11 04:42:46,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:46,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938766855] [2024-10-11 04:42:46,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:46,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:46,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:46,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:46,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938766855] [2024-10-11 04:42:46,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938766855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:46,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:46,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:42:46,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40281855] [2024-10-11 04:42:46,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:46,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:46,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:46,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:46,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:46,064 INFO L87 Difference]: Start difference. First operand 1634 states and 2962 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:46,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:46,096 INFO L93 Difference]: Finished difference Result 1836 states and 3262 transitions. [2024-10-11 04:42:46,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:46,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-10-11 04:42:46,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:46,103 INFO L225 Difference]: With dead ends: 1836 [2024-10-11 04:42:46,103 INFO L226 Difference]: Without dead ends: 1727 [2024-10-11 04:42:46,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:46,105 INFO L432 NwaCegarLoop]: 1520 mSDtfsCounter, 1473 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:46,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 1577 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:46,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2024-10-11 04:42:46,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1725. [2024-10-11 04:42:46,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1725 states, 1723 states have (on average 1.7951247823563552) internal successors, (3093), 1724 states have internal predecessors, (3093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:46,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 3093 transitions. [2024-10-11 04:42:46,144 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 3093 transitions. Word has length 36 [2024-10-11 04:42:46,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:46,145 INFO L471 AbstractCegarLoop]: Abstraction has 1725 states and 3093 transitions. [2024-10-11 04:42:46,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:46,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 3093 transitions. [2024-10-11 04:42:46,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:42:46,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:46,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:42:46,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:42:46,146 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:46,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:46,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1743359271, now seen corresponding path program 1 times [2024-10-11 04:42:46,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:46,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608066239] [2024-10-11 04:42:46,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:46,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:46,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:46,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608066239] [2024-10-11 04:42:46,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608066239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:46,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:46,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:42:46,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249866877] [2024-10-11 04:42:46,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:46,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:46,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:46,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:46,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:46,190 INFO L87 Difference]: Start difference. First operand 1725 states and 3093 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:46,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:46,221 INFO L93 Difference]: Finished difference Result 2093 states and 3627 transitions. [2024-10-11 04:42:46,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:46,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-10-11 04:42:46,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:46,229 INFO L225 Difference]: With dead ends: 2093 [2024-10-11 04:42:46,229 INFO L226 Difference]: Without dead ends: 1893 [2024-10-11 04:42:46,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:46,231 INFO L432 NwaCegarLoop]: 1530 mSDtfsCounter, 1475 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:46,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1583 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:46,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2024-10-11 04:42:46,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1891. [2024-10-11 04:42:46,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1889 states have (on average 1.7591318157755427) internal successors, (3323), 1890 states have internal predecessors, (3323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:46,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 3323 transitions. [2024-10-11 04:42:46,274 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 3323 transitions. Word has length 36 [2024-10-11 04:42:46,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:46,274 INFO L471 AbstractCegarLoop]: Abstraction has 1891 states and 3323 transitions. [2024-10-11 04:42:46,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:46,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 3323 transitions. [2024-10-11 04:42:46,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 04:42:46,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:46,275 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:42:46,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:42:46,275 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:46,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:46,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1790191284, now seen corresponding path program 1 times [2024-10-11 04:42:46,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:46,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925907931] [2024-10-11 04:42:46,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:46,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:46,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:46,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:46,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925907931] [2024-10-11 04:42:46,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925907931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:46,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:46,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:42:46,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790119051] [2024-10-11 04:42:46,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:46,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:46,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:46,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:46,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:46,316 INFO L87 Difference]: Start difference. First operand 1891 states and 3323 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:46,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:46,352 INFO L93 Difference]: Finished difference Result 2282 states and 3897 transitions. [2024-10-11 04:42:46,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:46,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-10-11 04:42:46,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:46,361 INFO L225 Difference]: With dead ends: 2282 [2024-10-11 04:42:46,361 INFO L226 Difference]: Without dead ends: 2063 [2024-10-11 04:42:46,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:46,363 INFO L432 NwaCegarLoop]: 1535 mSDtfsCounter, 1474 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:46,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1584 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:46,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2024-10-11 04:42:46,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 2061. [2024-10-11 04:42:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2061 states, 2059 states have (on average 1.7294803302574064) internal successors, (3561), 2060 states have internal predecessors, (3561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:46,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 3561 transitions. [2024-10-11 04:42:46,409 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 3561 transitions. Word has length 38 [2024-10-11 04:42:46,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:46,410 INFO L471 AbstractCegarLoop]: Abstraction has 2061 states and 3561 transitions. [2024-10-11 04:42:46,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:46,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 3561 transitions. [2024-10-11 04:42:46,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:42:46,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:46,411 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:42:46,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:42:46,411 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:46,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:46,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1496014032, now seen corresponding path program 1 times [2024-10-11 04:42:46,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:46,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005212394] [2024-10-11 04:42:46,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:46,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 04:42:46,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:46,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005212394] [2024-10-11 04:42:46,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005212394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:46,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:46,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:42:46,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701517669] [2024-10-11 04:42:46,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:46,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:42:46,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:46,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:42:46,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:42:46,554 INFO L87 Difference]: Start difference. First operand 2061 states and 3561 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:46,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:46,673 INFO L93 Difference]: Finished difference Result 3785 states and 6009 transitions. [2024-10-11 04:42:46,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:42:46,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 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-10-11 04:42:46,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:46,685 INFO L225 Difference]: With dead ends: 3785 [2024-10-11 04:42:46,686 INFO L226 Difference]: Without dead ends: 3251 [2024-10-11 04:42:46,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:42:46,735 INFO L432 NwaCegarLoop]: 1543 mSDtfsCounter, 3051 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3051 SdHoareTripleChecker+Valid, 3138 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:46,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3051 Valid, 3138 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:42:46,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3251 states. [2024-10-11 04:42:46,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3251 to 2593. [2024-10-11 04:42:46,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2593 states, 2591 states have (on average 1.6630644538788113) internal successors, (4309), 2592 states have internal predecessors, (4309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 4309 transitions. [2024-10-11 04:42:46,800 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 4309 transitions. Word has length 50 [2024-10-11 04:42:46,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:46,801 INFO L471 AbstractCegarLoop]: Abstraction has 2593 states and 4309 transitions. [2024-10-11 04:42:46,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:46,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 4309 transitions. [2024-10-11 04:42:46,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:42:46,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:46,802 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:42:46,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:42:46,803 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:46,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:46,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1910219824, now seen corresponding path program 1 times [2024-10-11 04:42:46,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:46,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970698892] [2024-10-11 04:42:46,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:46,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:46,953 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 04:42:46,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:46,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970698892] [2024-10-11 04:42:46,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970698892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:46,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:46,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:42:46,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177060960] [2024-10-11 04:42:46,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:46,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:42:46,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:46,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:42:46,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:42:46,955 INFO L87 Difference]: Start difference. First operand 2593 states and 4309 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-10-11 04:42:47,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:47,072 INFO L93 Difference]: Finished difference Result 4317 states and 6757 transitions. [2024-10-11 04:42:47,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:42:47,073 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 50 [2024-10-11 04:42:47,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:47,091 INFO L225 Difference]: With dead ends: 4317 [2024-10-11 04:42:47,092 INFO L226 Difference]: Without dead ends: 3783 [2024-10-11 04:42:47,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:42:47,095 INFO L432 NwaCegarLoop]: 1544 mSDtfsCounter, 3047 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3047 SdHoareTripleChecker+Valid, 3142 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:47,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3047 Valid, 3142 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:47,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2024-10-11 04:42:47,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3393. [2024-10-11 04:42:47,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3393 states, 3391 states have (on average 1.5986434680035388) internal successors, (5421), 3392 states have internal predecessors, (5421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3393 states to 3393 states and 5421 transitions. [2024-10-11 04:42:47,191 INFO L78 Accepts]: Start accepts. Automaton has 3393 states and 5421 transitions. Word has length 50 [2024-10-11 04:42:47,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:47,191 INFO L471 AbstractCegarLoop]: Abstraction has 3393 states and 5421 transitions. [2024-10-11 04:42:47,191 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-10-11 04:42:47,191 INFO L276 IsEmpty]: Start isEmpty. Operand 3393 states and 5421 transitions. [2024-10-11 04:42:47,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 04:42:47,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:47,193 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:42:47,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:42:47,194 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:47,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:47,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1024014232, now seen corresponding path program 1 times [2024-10-11 04:42:47,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:47,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931770161] [2024-10-11 04:42:47,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:47,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:47,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:47,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931770161] [2024-10-11 04:42:47,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931770161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:47,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:47,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:42:47,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344693200] [2024-10-11 04:42:47,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:47,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:47,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:47,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:47,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:47,289 INFO L87 Difference]: Start difference. First operand 3393 states and 5421 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:47,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:47,335 INFO L93 Difference]: Finished difference Result 4756 states and 7371 transitions. [2024-10-11 04:42:47,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:47,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-11 04:42:47,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:47,350 INFO L225 Difference]: With dead ends: 4756 [2024-10-11 04:42:47,350 INFO L226 Difference]: Without dead ends: 2890 [2024-10-11 04:42:47,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:47,356 INFO L432 NwaCegarLoop]: 1529 mSDtfsCounter, 34 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3020 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:47,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3020 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:47,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2024-10-11 04:42:47,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2888. [2024-10-11 04:42:47,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2888 states, 2886 states have (on average 1.6354816354816355) internal successors, (4720), 2887 states have internal predecessors, (4720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:47,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4720 transitions. [2024-10-11 04:42:47,428 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4720 transitions. Word has length 52 [2024-10-11 04:42:47,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:47,428 INFO L471 AbstractCegarLoop]: Abstraction has 2888 states and 4720 transitions. [2024-10-11 04:42:47,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4720 transitions. [2024-10-11 04:42:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 04:42:47,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:47,429 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:42:47,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:42:47,430 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:47,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:47,431 INFO L85 PathProgramCache]: Analyzing trace with hash -350989803, now seen corresponding path program 1 times [2024-10-11 04:42:47,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:47,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397767972] [2024-10-11 04:42:47,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:47,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:42:47,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:47,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397767972] [2024-10-11 04:42:47,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397767972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:47,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:47,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:42:47,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828734223] [2024-10-11 04:42:47,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:47,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:42:47,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:47,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:42:47,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:42:47,536 INFO L87 Difference]: Start difference. First operand 2888 states and 4720 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:47,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:47,638 INFO L93 Difference]: Finished difference Result 4048 states and 6380 transitions. [2024-10-11 04:42:47,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:42:47,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-11 04:42:47,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:47,647 INFO L225 Difference]: With dead ends: 4048 [2024-10-11 04:42:47,648 INFO L226 Difference]: Without dead ends: 3662 [2024-10-11 04:42:47,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:42:47,650 INFO L432 NwaCegarLoop]: 1541 mSDtfsCounter, 3045 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3045 SdHoareTripleChecker+Valid, 3130 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:47,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3045 Valid, 3130 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2024-10-11 04:42:47,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3272. [2024-10-11 04:42:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3272 states, 3270 states have (on average 1.6097859327217126) internal successors, (5264), 3271 states have internal predecessors, (5264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:47,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3272 states to 3272 states and 5264 transitions. [2024-10-11 04:42:47,751 INFO L78 Accepts]: Start accepts. Automaton has 3272 states and 5264 transitions. Word has length 52 [2024-10-11 04:42:47,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:47,753 INFO L471 AbstractCegarLoop]: Abstraction has 3272 states and 5264 transitions. [2024-10-11 04:42:47,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:47,754 INFO L276 IsEmpty]: Start isEmpty. Operand 3272 states and 5264 transitions. [2024-10-11 04:42:47,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 04:42:47,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:47,758 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:42:47,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:42:47,759 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:47,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:47,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1851821966, now seen corresponding path program 1 times [2024-10-11 04:42:47,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:47,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725632648] [2024-10-11 04:42:47,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:47,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:47,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:47,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:47,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725632648] [2024-10-11 04:42:47,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725632648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:47,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:47,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:42:47,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638849279] [2024-10-11 04:42:47,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:47,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:47,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:47,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:47,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:47,857 INFO L87 Difference]: Start difference. First operand 3272 states and 5264 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:47,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:47,896 INFO L93 Difference]: Finished difference Result 4140 states and 6490 transitions. [2024-10-11 04:42:47,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:47,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-11 04:42:47,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:47,902 INFO L225 Difference]: With dead ends: 4140 [2024-10-11 04:42:47,902 INFO L226 Difference]: Without dead ends: 2410 [2024-10-11 04:42:47,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:47,906 INFO L432 NwaCegarLoop]: 1522 mSDtfsCounter, 29 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3005 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:47,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3005 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:47,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2024-10-11 04:42:47,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2408. [2024-10-11 04:42:47,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2408 states, 2406 states have (on average 1.6716541978387365) internal successors, (4022), 2407 states have internal predecessors, (4022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 4022 transitions. [2024-10-11 04:42:47,953 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 4022 transitions. Word has length 53 [2024-10-11 04:42:47,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:47,953 INFO L471 AbstractCegarLoop]: Abstraction has 2408 states and 4022 transitions. [2024-10-11 04:42:47,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:47,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 4022 transitions. [2024-10-11 04:42:47,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:42:47,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:47,954 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:42:47,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:42:47,955 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:47,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:47,955 INFO L85 PathProgramCache]: Analyzing trace with hash -232466016, now seen corresponding path program 1 times [2024-10-11 04:42:47,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:47,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335865730] [2024-10-11 04:42:47,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:47,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:47,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:48,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:48,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335865730] [2024-10-11 04:42:48,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335865730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:42:48,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:42:48,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:42:48,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795516018] [2024-10-11 04:42:48,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:42:48,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:42:48,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:48,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:42:48,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:48,037 INFO L87 Difference]: Start difference. First operand 2408 states and 4022 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:48,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:48,102 INFO L93 Difference]: Finished difference Result 2844 states and 4627 transitions. [2024-10-11 04:42:48,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:42:48,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-11 04:42:48,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:48,108 INFO L225 Difference]: With dead ends: 2844 [2024-10-11 04:42:48,108 INFO L226 Difference]: Without dead ends: 1978 [2024-10-11 04:42:48,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:42:48,111 INFO L432 NwaCegarLoop]: 1515 mSDtfsCounter, 26 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2990 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:48,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2990 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:42:48,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2024-10-11 04:42:48,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1976. [2024-10-11 04:42:48,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1976 states, 1974 states have (on average 1.7274569402228976) internal successors, (3410), 1975 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:48,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 3410 transitions. [2024-10-11 04:42:48,159 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 3410 transitions. Word has length 55 [2024-10-11 04:42:48,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:48,160 INFO L471 AbstractCegarLoop]: Abstraction has 1976 states and 3410 transitions. [2024-10-11 04:42:48,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:48,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 3410 transitions. [2024-10-11 04:42:48,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 04:42:48,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:48,161 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 04:42:48,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 04:42:48,162 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:48,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:48,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1088629682, now seen corresponding path program 1 times [2024-10-11 04:42:48,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:48,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475379344] [2024-10-11 04:42:48,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:48,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:50,252 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:50,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:50,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475379344] [2024-10-11 04:42:50,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475379344] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:42:50,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209913672] [2024-10-11 04:42:50,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:50,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:42:50,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:42:50,255 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:42:50,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 04:42:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:50,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 04:42:50,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:42:50,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:42:50,564 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:42:50,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:42:50,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209913672] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:42:50,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:42:50,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 4] total 18 [2024-10-11 04:42:50,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675477667] [2024-10-11 04:42:50,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:42:50,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 04:42:50,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:50,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 04:42:50,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-10-11 04:42:50,724 INFO L87 Difference]: Start difference. First operand 1976 states and 3410 transitions. Second operand has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:53,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:53,846 INFO L93 Difference]: Finished difference Result 4285 states and 6492 transitions. [2024-10-11 04:42:53,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-11 04:42:53,847 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 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 57 [2024-10-11 04:42:53,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:53,854 INFO L225 Difference]: With dead ends: 4285 [2024-10-11 04:42:53,855 INFO L226 Difference]: Without dead ends: 3851 [2024-10-11 04:42:53,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=719, Invalid=3063, Unknown=0, NotChecked=0, Total=3782 [2024-10-11 04:42:53,858 INFO L432 NwaCegarLoop]: 1492 mSDtfsCounter, 17155 mSDsluCounter, 6118 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17155 SdHoareTripleChecker+Valid, 7610 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:53,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17155 Valid, 7610 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:42:53,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2024-10-11 04:42:54,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3773. [2024-10-11 04:42:54,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3773 states, 3771 states have (on average 1.4996022275258551) internal successors, (5655), 3772 states have internal predecessors, (5655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3773 states to 3773 states and 5655 transitions. [2024-10-11 04:42:54,020 INFO L78 Accepts]: Start accepts. Automaton has 3773 states and 5655 transitions. Word has length 57 [2024-10-11 04:42:54,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:54,021 INFO L471 AbstractCegarLoop]: Abstraction has 3773 states and 5655 transitions. [2024-10-11 04:42:54,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3773 states and 5655 transitions. [2024-10-11 04:42:54,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 04:42:54,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:54,023 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:42:54,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 04:42:54,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 04:42:54,224 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:54,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:54,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2061000929, now seen corresponding path program 1 times [2024-10-11 04:42:54,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:54,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675817708] [2024-10-11 04:42:54,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:54,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:56,368 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:56,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:56,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675817708] [2024-10-11 04:42:56,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675817708] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:42:56,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433899325] [2024-10-11 04:42:56,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:56,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:42:56,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:42:56,372 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:42:56,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 04:42:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:56,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:42:56,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:42:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:56,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:42:57,390 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:57,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433899325] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:42:57,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:42:57,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2024-10-11 04:42:57,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443914610] [2024-10-11 04:42:57,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:42:57,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 04:42:57,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:42:57,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 04:42:57,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2024-10-11 04:42:57,393 INFO L87 Difference]: Start difference. First operand 3773 states and 5655 transitions. Second operand has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 25 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:58,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:42:58,013 INFO L93 Difference]: Finished difference Result 7800 states and 10828 transitions. [2024-10-11 04:42:58,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:42:58,015 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 25 states have internal predecessors, (141), 0 states have call successors, (0), 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 58 [2024-10-11 04:42:58,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:42:58,026 INFO L225 Difference]: With dead ends: 7800 [2024-10-11 04:42:58,027 INFO L226 Difference]: Without dead ends: 5959 [2024-10-11 04:42:58,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=298, Invalid=1034, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 04:42:58,032 INFO L432 NwaCegarLoop]: 1489 mSDtfsCounter, 16628 mSDsluCounter, 3193 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16628 SdHoareTripleChecker+Valid, 4682 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:42:58,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16628 Valid, 4682 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:42:58,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5959 states. [2024-10-11 04:42:58,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5959 to 5893. [2024-10-11 04:42:58,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5893 states, 5891 states have (on average 1.4038363605499915) internal successors, (8270), 5892 states have internal predecessors, (8270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:58,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5893 states to 5893 states and 8270 transitions. [2024-10-11 04:42:58,265 INFO L78 Accepts]: Start accepts. Automaton has 5893 states and 8270 transitions. Word has length 58 [2024-10-11 04:42:58,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:42:58,265 INFO L471 AbstractCegarLoop]: Abstraction has 5893 states and 8270 transitions. [2024-10-11 04:42:58,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 25 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:42:58,266 INFO L276 IsEmpty]: Start isEmpty. Operand 5893 states and 8270 transitions. [2024-10-11 04:42:58,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 04:42:58,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:42:58,267 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:42:58,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 04:42:58,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 04:42:58,468 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:42:58,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:42:58,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1390462255, now seen corresponding path program 1 times [2024-10-11 04:42:58,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:42:58,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160164838] [2024-10-11 04:42:58,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:58,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:42:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:58,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:58,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:42:58,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160164838] [2024-10-11 04:42:58,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160164838] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:42:58,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234594072] [2024-10-11 04:42:58,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:42:58,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:42:58,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:42:58,772 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:42:58,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 04:42:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:42:58,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 04:42:58,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:42:59,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:42:59,378 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:43:00,239 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:00,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234594072] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:43:00,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:43:00,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2024-10-11 04:43:00,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471826754] [2024-10-11 04:43:00,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:43:00,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 04:43:00,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:00,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 04:43:00,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2024-10-11 04:43:00,242 INFO L87 Difference]: Start difference. First operand 5893 states and 8270 transitions. Second operand has 32 states, 32 states have (on average 4.65625) internal successors, (149), 32 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:03,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:03,087 INFO L93 Difference]: Finished difference Result 15452 states and 20378 transitions. [2024-10-11 04:43:03,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-10-11 04:43:03,088 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.65625) internal successors, (149), 32 states have internal predecessors, (149), 0 states have call successors, (0), 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 58 [2024-10-11 04:43:03,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:03,108 INFO L225 Difference]: With dead ends: 15452 [2024-10-11 04:43:03,108 INFO L226 Difference]: Without dead ends: 11590 [2024-10-11 04:43:03,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1630 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1214, Invalid=5592, Unknown=0, NotChecked=0, Total=6806 [2024-10-11 04:43:03,116 INFO L432 NwaCegarLoop]: 1502 mSDtfsCounter, 15605 mSDsluCounter, 13951 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15605 SdHoareTripleChecker+Valid, 15453 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:03,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15605 Valid, 15453 Invalid, 1028 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 04:43:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11590 states. [2024-10-11 04:43:03,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11590 to 7928. [2024-10-11 04:43:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7928 states, 7926 states have (on average 1.3569265707797122) internal successors, (10755), 7927 states have internal predecessors, (10755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7928 states to 7928 states and 10755 transitions. [2024-10-11 04:43:03,405 INFO L78 Accepts]: Start accepts. Automaton has 7928 states and 10755 transitions. Word has length 58 [2024-10-11 04:43:03,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:03,406 INFO L471 AbstractCegarLoop]: Abstraction has 7928 states and 10755 transitions. [2024-10-11 04:43:03,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.65625) internal successors, (149), 32 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:03,406 INFO L276 IsEmpty]: Start isEmpty. Operand 7928 states and 10755 transitions. [2024-10-11 04:43:03,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 04:43:03,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:03,407 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:43:03,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 04:43:03,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:03,608 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:03,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:03,609 INFO L85 PathProgramCache]: Analyzing trace with hash -389434110, now seen corresponding path program 1 times [2024-10-11 04:43:03,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:03,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580506213] [2024-10-11 04:43:03,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:03,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:03,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:03,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580506213] [2024-10-11 04:43:03,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580506213] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:43:03,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465513231] [2024-10-11 04:43:03,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:03,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:03,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:43:03,937 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:43:03,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 04:43:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:04,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 04:43:04,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:43:04,393 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:04,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:43:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:04,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465513231] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:43:04,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:43:04,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-10-11 04:43:04,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568282199] [2024-10-11 04:43:04,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:43:04,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 04:43:04,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:04,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 04:43:04,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-10-11 04:43:04,872 INFO L87 Difference]: Start difference. First operand 7928 states and 10755 transitions. Second operand has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:05,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:05,506 INFO L93 Difference]: Finished difference Result 13504 states and 17776 transitions. [2024-10-11 04:43:05,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 04:43:05,507 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 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 59 [2024-10-11 04:43:05,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:05,523 INFO L225 Difference]: With dead ends: 13504 [2024-10-11 04:43:05,523 INFO L226 Difference]: Without dead ends: 8244 [2024-10-11 04:43:05,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2024-10-11 04:43:05,532 INFO L432 NwaCegarLoop]: 1495 mSDtfsCounter, 10579 mSDsluCounter, 3188 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10579 SdHoareTripleChecker+Valid, 4683 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:05,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10579 Valid, 4683 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:43:05,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8244 states. [2024-10-11 04:43:05,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8244 to 7852. [2024-10-11 04:43:05,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7852 states, 7850 states have (on average 1.347515923566879) internal successors, (10578), 7851 states have internal predecessors, (10578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:05,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7852 states to 7852 states and 10578 transitions. [2024-10-11 04:43:05,791 INFO L78 Accepts]: Start accepts. Automaton has 7852 states and 10578 transitions. Word has length 59 [2024-10-11 04:43:05,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:05,792 INFO L471 AbstractCegarLoop]: Abstraction has 7852 states and 10578 transitions. [2024-10-11 04:43:05,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:05,792 INFO L276 IsEmpty]: Start isEmpty. Operand 7852 states and 10578 transitions. [2024-10-11 04:43:05,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 04:43:05,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:05,793 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:43:05,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 04:43:05,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:05,994 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:05,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:05,994 INFO L85 PathProgramCache]: Analyzing trace with hash -912038320, now seen corresponding path program 1 times [2024-10-11 04:43:05,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:05,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375911982] [2024-10-11 04:43:05,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:05,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:06,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:06,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375911982] [2024-10-11 04:43:06,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375911982] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:43:06,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705418478] [2024-10-11 04:43:06,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:06,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:06,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:43:06,650 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:43:06,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 04:43:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:06,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-11 04:43:06,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:43:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:08,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:43:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:10,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705418478] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:43:10,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:43:10,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 17] total 43 [2024-10-11 04:43:10,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868793085] [2024-10-11 04:43:10,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:43:10,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-11 04:43:10,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:10,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-11 04:43:10,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1585, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 04:43:10,586 INFO L87 Difference]: Start difference. First operand 7852 states and 10578 transitions. Second operand has 43 states, 43 states have (on average 3.558139534883721) internal successors, (153), 43 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:17,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:17,500 INFO L93 Difference]: Finished difference Result 10066 states and 13361 transitions. [2024-10-11 04:43:17,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-10-11 04:43:17,501 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.558139534883721) internal successors, (153), 43 states have internal predecessors, (153), 0 states have call successors, (0), 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 59 [2024-10-11 04:43:17,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:17,513 INFO L225 Difference]: With dead ends: 10066 [2024-10-11 04:43:17,514 INFO L226 Difference]: Without dead ends: 6575 [2024-10-11 04:43:17,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2596 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=2067, Invalid=8033, Unknown=0, NotChecked=0, Total=10100 [2024-10-11 04:43:17,523 INFO L432 NwaCegarLoop]: 1523 mSDtfsCounter, 14514 mSDsluCounter, 21637 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14514 SdHoareTripleChecker+Valid, 23160 SdHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:17,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14514 Valid, 23160 Invalid, 1791 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 1734 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:43:17,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6575 states. [2024-10-11 04:43:17,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6575 to 6213. [2024-10-11 04:43:17,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6213 states, 6211 states have (on average 1.3759459024311704) internal successors, (8546), 6212 states have internal predecessors, (8546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:17,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 8546 transitions. [2024-10-11 04:43:17,765 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 8546 transitions. Word has length 59 [2024-10-11 04:43:17,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:17,766 INFO L471 AbstractCegarLoop]: Abstraction has 6213 states and 8546 transitions. [2024-10-11 04:43:17,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.558139534883721) internal successors, (153), 43 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:17,767 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 8546 transitions. [2024-10-11 04:43:17,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 04:43:17,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:17,768 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:43:17,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 04:43:17,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:17,973 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:17,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:17,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1146030742, now seen corresponding path program 1 times [2024-10-11 04:43:17,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:17,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268238794] [2024-10-11 04:43:17,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:17,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:19,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:19,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268238794] [2024-10-11 04:43:19,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268238794] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:43:19,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834364332] [2024-10-11 04:43:19,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:19,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:19,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:43:19,641 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:43:19,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 04:43:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:19,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 04:43:19,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:43:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:22,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:43:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:25,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834364332] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:43:25,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:43:25,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 57 [2024-10-11 04:43:25,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388264970] [2024-10-11 04:43:25,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:43:25,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-10-11 04:43:25,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:25,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-10-11 04:43:25,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=2885, Unknown=0, NotChecked=0, Total=3192 [2024-10-11 04:43:25,868 INFO L87 Difference]: Start difference. First operand 6213 states and 8546 transitions. Second operand has 57 states, 57 states have (on average 2.824561403508772) internal successors, (161), 57 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)