./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.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/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.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 e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:22:39,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:22:39,922 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:22:39,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:22:39,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:22:39,960 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:22:39,961 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:22:39,962 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:22:39,962 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:22:39,962 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:22:39,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:22:39,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:22:39,964 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:22:39,964 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:22:39,964 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:22:39,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:22:39,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:22:39,965 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:22:39,966 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:22:39,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:22:39,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:22:39,967 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:22:39,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:22:39,967 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:22:39,968 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:22:39,968 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:22:39,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:22:39,969 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:22:39,969 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:22:39,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:22:39,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:22:39,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:22:39,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:22:39,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:22:39,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:22:39,971 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:22:39,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:22:39,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:22:39,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:22:39,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:22:39,972 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:22:39,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:22:39,973 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 -> e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca [2024-10-11 03:22:40,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:22:40,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:22:40,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:22:40,243 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:22:40,244 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:22:40,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2024-10-11 03:22:41,609 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:22:41,779 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:22:41,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2024-10-11 03:22:41,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7ea5ba6cb/8fd02f08274f4ec887deca87f20498da/FLAG11941ed9f [2024-10-11 03:22:42,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7ea5ba6cb/8fd02f08274f4ec887deca87f20498da [2024-10-11 03:22:42,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:22:42,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:22:42,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:22:42,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:22:42,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:22:42,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:22:42" (1/1) ... [2024-10-11 03:22:42,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@434bbef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:42, skipping insertion in model container [2024-10-11 03:22:42,185 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:22:42" (1/1) ... [2024-10-11 03:22:42,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:22:42,415 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2024-10-11 03:22:42,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:22:42,427 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:22:42,456 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2024-10-11 03:22:42,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:22:42,470 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:22:42,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:42 WrapperNode [2024-10-11 03:22:42,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:22:42,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:22:42,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:22:42,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:22:42,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:42" (1/1) ... [2024-10-11 03:22:42,485 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:42" (1/1) ... [2024-10-11 03:22:42,504 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 220 [2024-10-11 03:22:42,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:22:42,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:22:42,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:22:42,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:22:42,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:42" (1/1) ... [2024-10-11 03:22:42,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:42" (1/1) ... [2024-10-11 03:22:42,517 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:42" (1/1) ... [2024-10-11 03:22:42,535 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 03:22:42,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:42" (1/1) ... [2024-10-11 03:22:42,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:42" (1/1) ... [2024-10-11 03:22:42,539 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:42" (1/1) ... [2024-10-11 03:22:42,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:42" (1/1) ... [2024-10-11 03:22:42,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:42" (1/1) ... [2024-10-11 03:22:42,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:42" (1/1) ... [2024-10-11 03:22:42,553 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:22:42,554 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:22:42,554 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:22:42,554 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:22:42,554 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:42" (1/1) ... [2024-10-11 03:22:42,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:22:42,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:22:42,587 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 03:22:42,595 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 03:22:42,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:22:42,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:22:42,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:22:42,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:22:42,690 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:22:42,691 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:22:42,969 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-10-11 03:22:42,970 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:22:43,014 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:22:43,015 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 03:22:43,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:22:43 BoogieIcfgContainer [2024-10-11 03:22:43,016 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:22:43,017 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:22:43,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:22:43,021 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:22:43,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:22:42" (1/3) ... [2024-10-11 03:22:43,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0cbb94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:22:43, skipping insertion in model container [2024-10-11 03:22:43,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:22:42" (2/3) ... [2024-10-11 03:22:43,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0cbb94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:22:43, skipping insertion in model container [2024-10-11 03:22:43,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:22:43" (3/3) ... [2024-10-11 03:22:43,023 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2024-10-11 03:22:43,039 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:22:43,039 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:22:43,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:22:43,091 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;@615ede2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:22:43,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:22:43,096 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 50 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:22:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 03:22:43,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:22:43,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:22:43,102 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:22:43,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:22:43,107 INFO L85 PathProgramCache]: Analyzing trace with hash -417268953, now seen corresponding path program 1 times [2024-10-11 03:22:43,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:22:43,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919743134] [2024-10-11 03:22:43,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:43,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:22:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:43,299 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 03:22:43,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:22:43,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919743134] [2024-10-11 03:22:43,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919743134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:22:43,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:22:43,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:22:43,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730526290] [2024-10-11 03:22:43,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:22:43,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 03:22:43,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:22:43,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 03:22:43,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:22:43,325 INFO L87 Difference]: Start difference. First operand has 51 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 50 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 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 03:22:43,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:22:43,400 INFO L93 Difference]: Finished difference Result 81 states and 137 transitions. [2024-10-11 03:22:43,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 03:22:43,408 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-10-11 03:22:43,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:22:43,414 INFO L225 Difference]: With dead ends: 81 [2024-10-11 03:22:43,415 INFO L226 Difference]: Without dead ends: 49 [2024-10-11 03:22:43,417 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 03:22:43,420 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:22:43,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:22:43,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-11 03:22:43,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-11 03:22:43,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 48 states have internal predecessors, (82), 0 states have call successors, (0), 0 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 03:22:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 82 transitions. [2024-10-11 03:22:43,447 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 82 transitions. Word has length 16 [2024-10-11 03:22:43,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:22:43,447 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 82 transitions. [2024-10-11 03:22:43,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 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 03:22:43,448 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 82 transitions. [2024-10-11 03:22:43,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 03:22:43,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:22:43,448 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:22:43,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:22:43,449 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:22:43,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:22:43,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1004074967, now seen corresponding path program 1 times [2024-10-11 03:22:43,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:22:43,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127857110] [2024-10-11 03:22:43,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:43,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:22:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:43,574 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 03:22:43,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:22:43,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127857110] [2024-10-11 03:22:43,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127857110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:22:43,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:22:43,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:22:43,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487856921] [2024-10-11 03:22:43,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:22:43,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:22:43,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:22:43,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:22:43,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:22:43,578 INFO L87 Difference]: Start difference. First operand 49 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 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 03:22:43,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:22:43,628 INFO L93 Difference]: Finished difference Result 81 states and 131 transitions. [2024-10-11 03:22:43,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:22:43,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-10-11 03:22:43,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:22:43,630 INFO L225 Difference]: With dead ends: 81 [2024-10-11 03:22:43,630 INFO L226 Difference]: Without dead ends: 49 [2024-10-11 03:22:43,631 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 03:22:43,631 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:22:43,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:22:43,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-11 03:22:43,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-11 03:22:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:22:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2024-10-11 03:22:43,637 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 16 [2024-10-11 03:22:43,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:22:43,638 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2024-10-11 03:22:43,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 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 03:22:43,638 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2024-10-11 03:22:43,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 03:22:43,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:22:43,639 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] [2024-10-11 03:22:43,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:22:43,640 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:22:43,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:22:43,640 INFO L85 PathProgramCache]: Analyzing trace with hash 871528204, now seen corresponding path program 1 times [2024-10-11 03:22:43,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:22:43,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211338677] [2024-10-11 03:22:43,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:43,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:22:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:43,786 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 03:22:43,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:22:43,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211338677] [2024-10-11 03:22:43,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211338677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:22:43,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:22:43,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:22:43,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581036691] [2024-10-11 03:22:43,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:22:43,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:22:43,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:22:43,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:22:43,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:22:43,788 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 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 03:22:43,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:22:43,920 INFO L93 Difference]: Finished difference Result 223 states and 342 transitions. [2024-10-11 03:22:43,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:22:43,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-10-11 03:22:43,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:22:43,924 INFO L225 Difference]: With dead ends: 223 [2024-10-11 03:22:43,924 INFO L226 Difference]: Without dead ends: 194 [2024-10-11 03:22:43,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:22:43,926 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 264 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:22:43,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 402 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:22:43,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-11 03:22:43,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 76. [2024-10-11 03:22:43,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 75 states have internal predecessors, (109), 0 states have call successors, (0), 0 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 03:22:43,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 109 transitions. [2024-10-11 03:22:43,941 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 109 transitions. Word has length 31 [2024-10-11 03:22:43,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:22:43,942 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 109 transitions. [2024-10-11 03:22:43,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 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 03:22:43,942 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 109 transitions. [2024-10-11 03:22:43,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 03:22:43,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:22:43,943 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] [2024-10-11 03:22:43,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:22:43,943 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:22:43,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:22:43,943 INFO L85 PathProgramCache]: Analyzing trace with hash -739726020, now seen corresponding path program 1 times [2024-10-11 03:22:43,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:22:43,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693642920] [2024-10-11 03:22:43,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:43,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:22:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:44,022 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 03:22:44,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:22:44,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693642920] [2024-10-11 03:22:44,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693642920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:22:44,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:22:44,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:22:44,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925466462] [2024-10-11 03:22:44,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:22:44,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:22:44,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:22:44,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:22:44,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:22:44,024 INFO L87 Difference]: Start difference. First operand 76 states and 109 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 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 03:22:44,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:22:44,055 INFO L93 Difference]: Finished difference Result 177 states and 268 transitions. [2024-10-11 03:22:44,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:22:44,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-10-11 03:22:44,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:22:44,059 INFO L225 Difference]: With dead ends: 177 [2024-10-11 03:22:44,059 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 03:22:44,060 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 03:22:44,061 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 26 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:22:44,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 101 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:22:44,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 03:22:44,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2024-10-11 03:22:44,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 118 states have internal predecessors, (175), 0 states have call successors, (0), 0 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 03:22:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 175 transitions. [2024-10-11 03:22:44,072 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 175 transitions. Word has length 33 [2024-10-11 03:22:44,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:22:44,073 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 175 transitions. [2024-10-11 03:22:44,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 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 03:22:44,073 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 175 transitions. [2024-10-11 03:22:44,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 03:22:44,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:22:44,074 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] [2024-10-11 03:22:44,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:22:44,074 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:22:44,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:22:44,075 INFO L85 PathProgramCache]: Analyzing trace with hash -737581068, now seen corresponding path program 1 times [2024-10-11 03:22:44,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:22:44,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390647514] [2024-10-11 03:22:44,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:44,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:22:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:44,261 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 03:22:44,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:22:44,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390647514] [2024-10-11 03:22:44,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390647514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:22:44,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:22:44,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:22:44,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568803125] [2024-10-11 03:22:44,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:22:44,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:22:44,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:22:44,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:22:44,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:22:44,264 INFO L87 Difference]: Start difference. First operand 119 states and 175 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 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 03:22:44,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:22:44,331 INFO L93 Difference]: Finished difference Result 220 states and 331 transitions. [2024-10-11 03:22:44,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:22:44,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-10-11 03:22:44,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:22:44,334 INFO L225 Difference]: With dead ends: 220 [2024-10-11 03:22:44,334 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 03:22:44,335 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 03:22:44,336 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 35 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:22:44,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 181 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:22:44,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 03:22:44,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2024-10-11 03:22:44,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 118 states have internal predecessors, (173), 0 states have call successors, (0), 0 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 03:22:44,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 173 transitions. [2024-10-11 03:22:44,342 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 173 transitions. Word has length 33 [2024-10-11 03:22:44,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:22:44,342 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 173 transitions. [2024-10-11 03:22:44,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 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 03:22:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 173 transitions. [2024-10-11 03:22:44,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:22:44,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:22:44,343 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 03:22:44,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:22:44,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:22:44,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:22:44,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1404220512, now seen corresponding path program 1 times [2024-10-11 03:22:44,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:22:44,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701069351] [2024-10-11 03:22:44,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:44,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:22:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:44,444 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 03:22:44,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:22:44,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701069351] [2024-10-11 03:22:44,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701069351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:22:44,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:22:44,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:22:44,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079906518] [2024-10-11 03:22:44,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:22:44,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:22:44,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:22:44,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:22:44,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:22:44,446 INFO L87 Difference]: Start difference. First operand 119 states and 173 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 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 03:22:44,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:22:44,465 INFO L93 Difference]: Finished difference Result 125 states and 180 transitions. [2024-10-11 03:22:44,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:22:44,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 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 03:22:44,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:22:44,466 INFO L225 Difference]: With dead ends: 125 [2024-10-11 03:22:44,466 INFO L226 Difference]: Without dead ends: 123 [2024-10-11 03:22:44,468 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 03:22:44,469 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 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 03:22:44,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:22:44,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-11 03:22:44,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-10-11 03:22:44,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.4426229508196722) internal successors, (176), 122 states have internal predecessors, (176), 0 states have call successors, (0), 0 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 03:22:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 176 transitions. [2024-10-11 03:22:44,484 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 176 transitions. Word has length 34 [2024-10-11 03:22:44,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:22:44,484 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 176 transitions. [2024-10-11 03:22:44,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 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 03:22:44,484 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 176 transitions. [2024-10-11 03:22:44,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 03:22:44,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:22:44,485 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 03:22:44,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:22:44,486 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:22:44,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:22:44,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1768252524, now seen corresponding path program 1 times [2024-10-11 03:22:44,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:22:44,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222234746] [2024-10-11 03:22:44,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:44,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:22:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:44,520 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 03:22:44,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:22:44,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222234746] [2024-10-11 03:22:44,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222234746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:22:44,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:22:44,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:22:44,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655392546] [2024-10-11 03:22:44,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:22:44,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:22:44,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:22:44,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:22:44,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:22:44,522 INFO L87 Difference]: Start difference. First operand 123 states and 176 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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 03:22:44,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:22:44,538 INFO L93 Difference]: Finished difference Result 237 states and 349 transitions. [2024-10-11 03:22:44,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:22:44,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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 03:22:44,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:22:44,539 INFO L225 Difference]: With dead ends: 237 [2024-10-11 03:22:44,539 INFO L226 Difference]: Without dead ends: 177 [2024-10-11 03:22:44,539 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 03:22:44,540 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 36 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:22:44,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 139 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:22:44,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-11 03:22:44,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2024-10-11 03:22:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.4540229885057472) internal successors, (253), 174 states have internal predecessors, (253), 0 states have call successors, (0), 0 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 03:22:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 253 transitions. [2024-10-11 03:22:44,548 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 253 transitions. Word has length 35 [2024-10-11 03:22:44,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:22:44,548 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 253 transitions. [2024-10-11 03:22:44,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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 03:22:44,549 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 253 transitions. [2024-10-11 03:22:44,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 03:22:44,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:22:44,549 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 03:22:44,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:22:44,550 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:22:44,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:22:44,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1901058708, now seen corresponding path program 1 times [2024-10-11 03:22:44,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:22:44,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438075302] [2024-10-11 03:22:44,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:44,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:22:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:44,589 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 03:22:44,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:22:44,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438075302] [2024-10-11 03:22:44,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438075302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:22:44,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:22:44,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:22:44,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174493095] [2024-10-11 03:22:44,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:22:44,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:22:44,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:22:44,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:22:44,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:22:44,591 INFO L87 Difference]: Start difference. First operand 175 states and 253 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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 03:22:44,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:22:44,608 INFO L93 Difference]: Finished difference Result 457 states and 673 transitions. [2024-10-11 03:22:44,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:22:44,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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 03:22:44,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:22:44,609 INFO L225 Difference]: With dead ends: 457 [2024-10-11 03:22:44,609 INFO L226 Difference]: Without dead ends: 304 [2024-10-11 03:22:44,610 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 03:22:44,610 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 34 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:22:44,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 145 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:22:44,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-11 03:22:44,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 302. [2024-10-11 03:22:44,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.4451827242524917) internal successors, (435), 301 states have internal predecessors, (435), 0 states have call successors, (0), 0 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 03:22:44,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 435 transitions. [2024-10-11 03:22:44,621 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 435 transitions. Word has length 35 [2024-10-11 03:22:44,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:22:44,621 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 435 transitions. [2024-10-11 03:22:44,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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 03:22:44,621 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 435 transitions. [2024-10-11 03:22:44,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 03:22:44,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:22:44,622 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 03:22:44,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:22:44,622 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:22:44,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:22:44,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1505175148, now seen corresponding path program 1 times [2024-10-11 03:22:44,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:22:44,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337622989] [2024-10-11 03:22:44,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:44,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:22:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:44,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:22:44,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:22:44,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337622989] [2024-10-11 03:22:44,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337622989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:22:44,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:22:44,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:22:44,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998214343] [2024-10-11 03:22:44,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:22:44,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:22:44,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:22:44,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:22:44,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:22:44,672 INFO L87 Difference]: Start difference. First operand 302 states and 435 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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 03:22:44,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:22:44,701 INFO L93 Difference]: Finished difference Result 814 states and 1177 transitions. [2024-10-11 03:22:44,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:22:44,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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 03:22:44,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:22:44,706 INFO L225 Difference]: With dead ends: 814 [2024-10-11 03:22:44,706 INFO L226 Difference]: Without dead ends: 534 [2024-10-11 03:22:44,707 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 03:22:44,708 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 32 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:22:44,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 147 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:22:44,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-10-11 03:22:44,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 532. [2024-10-11 03:22:44,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 531 states have (on average 1.4143126177024483) internal successors, (751), 531 states have internal predecessors, (751), 0 states have call successors, (0), 0 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 03:22:44,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 751 transitions. [2024-10-11 03:22:44,733 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 751 transitions. Word has length 35 [2024-10-11 03:22:44,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:22:44,733 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 751 transitions. [2024-10-11 03:22:44,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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 03:22:44,733 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 751 transitions. [2024-10-11 03:22:44,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:22:44,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:22:44,735 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] [2024-10-11 03:22:44,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:22:44,735 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:22:44,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:22:44,735 INFO L85 PathProgramCache]: Analyzing trace with hash -217205247, now seen corresponding path program 1 times [2024-10-11 03:22:44,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:22:44,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159055701] [2024-10-11 03:22:44,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:44,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:22:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:44,856 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 03:22:44,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:22:44,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159055701] [2024-10-11 03:22:44,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159055701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:22:44,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:22:44,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:22:44,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881647535] [2024-10-11 03:22:44,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:22:44,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:22:44,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:22:44,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:22:44,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:22:44,858 INFO L87 Difference]: Start difference. First operand 532 states and 751 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:22:44,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:22:44,944 INFO L93 Difference]: Finished difference Result 2040 states and 2903 transitions. [2024-10-11 03:22:44,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:22:44,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-11 03:22:44,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:22:44,949 INFO L225 Difference]: With dead ends: 2040 [2024-10-11 03:22:44,949 INFO L226 Difference]: Without dead ends: 1670 [2024-10-11 03:22:44,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 03:22:44,951 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 157 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:22:44,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 264 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:22:44,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2024-10-11 03:22:44,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 972. [2024-10-11 03:22:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.411946446961895) internal successors, (1371), 971 states have internal predecessors, (1371), 0 states have call successors, (0), 0 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 03:22:44,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1371 transitions. [2024-10-11 03:22:44,986 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1371 transitions. Word has length 49 [2024-10-11 03:22:44,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:22:44,986 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1371 transitions. [2024-10-11 03:22:44,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:22:44,986 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1371 transitions. [2024-10-11 03:22:44,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:22:44,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:22:44,987 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] [2024-10-11 03:22:44,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:22:44,988 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:22:44,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:22:44,988 INFO L85 PathProgramCache]: Analyzing trace with hash -842861311, now seen corresponding path program 1 times [2024-10-11 03:22:44,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:22:44,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744877300] [2024-10-11 03:22:44,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:44,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:22:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:45,096 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 03:22:45,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:22:45,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744877300] [2024-10-11 03:22:45,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744877300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:22:45,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:22:45,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:22:45,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983527056] [2024-10-11 03:22:45,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:22:45,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:22:45,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:22:45,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:22:45,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:22:45,097 INFO L87 Difference]: Start difference. First operand 972 states and 1371 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:22:45,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:22:45,191 INFO L93 Difference]: Finished difference Result 2548 states and 3623 transitions. [2024-10-11 03:22:45,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:22:45,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-11 03:22:45,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:22:45,198 INFO L225 Difference]: With dead ends: 2548 [2024-10-11 03:22:45,198 INFO L226 Difference]: Without dead ends: 2038 [2024-10-11 03:22:45,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 03:22:45,200 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 159 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:22:45,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 253 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:22:45,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2024-10-11 03:22:45,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 1664. [2024-10-11 03:22:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1664 states, 1663 states have (on average 1.4088995790739627) internal successors, (2343), 1663 states have internal predecessors, (2343), 0 states have call successors, (0), 0 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 03:22:45,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2343 transitions. [2024-10-11 03:22:45,249 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2343 transitions. Word has length 49 [2024-10-11 03:22:45,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:22:45,250 INFO L471 AbstractCegarLoop]: Abstraction has 1664 states and 2343 transitions. [2024-10-11 03:22:45,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:22:45,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2343 transitions. [2024-10-11 03:22:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:22:45,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:22:45,251 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] [2024-10-11 03:22:45,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:22:45,252 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:22:45,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:22:45,252 INFO L85 PathProgramCache]: Analyzing trace with hash 45872129, now seen corresponding path program 1 times [2024-10-11 03:22:45,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:22:45,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698315096] [2024-10-11 03:22:45,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:45,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:22:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:45,341 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 03:22:45,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:22:45,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698315096] [2024-10-11 03:22:45,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698315096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:22:45,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:22:45,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:22:45,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073210193] [2024-10-11 03:22:45,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:22:45,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:22:45,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:22:45,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:22:45,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:22:45,343 INFO L87 Difference]: Start difference. First operand 1664 states and 2343 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:22:45,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:22:45,436 INFO L93 Difference]: Finished difference Result 3056 states and 4339 transitions. [2024-10-11 03:22:45,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:22:45,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-11 03:22:45,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:22:45,443 INFO L225 Difference]: With dead ends: 3056 [2024-10-11 03:22:45,443 INFO L226 Difference]: Without dead ends: 2546 [2024-10-11 03:22:45,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 03:22:45,444 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 165 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:22:45,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 257 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:22:45,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2024-10-11 03:22:45,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2172. [2024-10-11 03:22:45,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2172 states, 2171 states have (on average 1.4090280976508522) internal successors, (3059), 2171 states have internal predecessors, (3059), 0 states have call successors, (0), 0 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 03:22:45,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 3059 transitions. [2024-10-11 03:22:45,533 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 3059 transitions. Word has length 49 [2024-10-11 03:22:45,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:22:45,533 INFO L471 AbstractCegarLoop]: Abstraction has 2172 states and 3059 transitions. [2024-10-11 03:22:45,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:22:45,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 3059 transitions. [2024-10-11 03:22:45,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:22:45,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:22:45,535 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] [2024-10-11 03:22:45,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:22:45,535 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:22:45,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:22:45,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1885157086, now seen corresponding path program 1 times [2024-10-11 03:22:45,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:22:45,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782832043] [2024-10-11 03:22:45,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:45,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:22:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:45,606 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 03:22:45,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:22:45,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782832043] [2024-10-11 03:22:45,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782832043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:22:45,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:22:45,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:22:45,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494289954] [2024-10-11 03:22:45,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:22:45,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:22:45,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:22:45,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:22:45,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:22:45,608 INFO L87 Difference]: Start difference. First operand 2172 states and 3059 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:22:45,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:22:45,657 INFO L93 Difference]: Finished difference Result 4324 states and 6097 transitions. [2024-10-11 03:22:45,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:22:45,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 03:22:45,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:22:45,663 INFO L225 Difference]: With dead ends: 4324 [2024-10-11 03:22:45,664 INFO L226 Difference]: Without dead ends: 2174 [2024-10-11 03:22:45,666 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 03:22:45,667 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 29 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:22:45,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 134 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:22:45,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2024-10-11 03:22:45,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 2172. [2024-10-11 03:22:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2172 states, 2171 states have (on average 1.3859972362966375) internal successors, (3009), 2171 states have internal predecessors, (3009), 0 states have call successors, (0), 0 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 03:22:45,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 3009 transitions. [2024-10-11 03:22:45,749 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 3009 transitions. Word has length 50 [2024-10-11 03:22:45,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:22:45,749 INFO L471 AbstractCegarLoop]: Abstraction has 2172 states and 3009 transitions. [2024-10-11 03:22:45,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:22:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 3009 transitions. [2024-10-11 03:22:45,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 03:22:45,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:22:45,750 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] [2024-10-11 03:22:45,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:22:45,750 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:22:45,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:22:45,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1001536681, now seen corresponding path program 1 times [2024-10-11 03:22:45,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:22:45,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353348684] [2024-10-11 03:22:45,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:45,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:22:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:45,814 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 03:22:45,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:22:45,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353348684] [2024-10-11 03:22:45,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353348684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:22:45,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:22:45,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:22:45,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563475057] [2024-10-11 03:22:45,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:22:45,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:22:45,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:22:45,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:22:45,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:22:45,815 INFO L87 Difference]: Start difference. First operand 2172 states and 3009 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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 03:22:45,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:22:45,845 INFO L93 Difference]: Finished difference Result 3018 states and 4196 transitions. [2024-10-11 03:22:45,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:22:45,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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 51 [2024-10-11 03:22:45,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:22:45,848 INFO L225 Difference]: With dead ends: 3018 [2024-10-11 03:22:45,848 INFO L226 Difference]: Without dead ends: 868 [2024-10-11 03:22:45,851 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 03:22:45,851 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:22:45,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 131 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:22:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2024-10-11 03:22:45,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 861. [2024-10-11 03:22:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 860 states have (on average 1.3767441860465117) internal successors, (1184), 860 states have internal predecessors, (1184), 0 states have call successors, (0), 0 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 03:22:45,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1184 transitions. [2024-10-11 03:22:45,874 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1184 transitions. Word has length 51 [2024-10-11 03:22:45,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:22:45,875 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1184 transitions. [2024-10-11 03:22:45,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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 03:22:45,875 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1184 transitions. [2024-10-11 03:22:45,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:22:45,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:22:45,876 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 03:22:45,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:22:45,877 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:22:45,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:22:45,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1455204816, now seen corresponding path program 1 times [2024-10-11 03:22:45,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:22:45,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315717329] [2024-10-11 03:22:45,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:45,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:22:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:45,940 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 03:22:45,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:22:45,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315717329] [2024-10-11 03:22:45,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315717329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:22:45,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:22:45,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:22:45,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260567887] [2024-10-11 03:22:45,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:22:45,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:22:45,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:22:45,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:22:45,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:22:45,941 INFO L87 Difference]: Start difference. First operand 861 states and 1184 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 03:22:45,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:22:45,965 INFO L93 Difference]: Finished difference Result 1279 states and 1762 transitions. [2024-10-11 03:22:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:22:45,966 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 03:22:45,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:22:45,968 INFO L225 Difference]: With dead ends: 1279 [2024-10-11 03:22:45,968 INFO L226 Difference]: Without dead ends: 449 [2024-10-11 03:22:45,970 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 03:22:45,970 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 25 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:22:45,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 110 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:22:45,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-10-11 03:22:45,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2024-10-11 03:22:45,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.34304932735426) internal successors, (599), 446 states have internal predecessors, (599), 0 states have call successors, (0), 0 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 03:22:45,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 599 transitions. [2024-10-11 03:22:45,982 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 599 transitions. Word has length 52 [2024-10-11 03:22:45,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:22:45,982 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 599 transitions. [2024-10-11 03:22:45,982 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 03:22:45,983 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 599 transitions. [2024-10-11 03:22:45,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 03:22:45,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:22:45,983 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] [2024-10-11 03:22:45,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:22:45,983 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:22:45,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:22:45,984 INFO L85 PathProgramCache]: Analyzing trace with hash 923352062, now seen corresponding path program 1 times [2024-10-11 03:22:45,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:22:45,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095751521] [2024-10-11 03:22:45,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:45,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:22:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:47,531 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 03:22:47,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:22:47,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095751521] [2024-10-11 03:22:47,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095751521] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:22:47,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687701444] [2024-10-11 03:22:47,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:47,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:22:47,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:22:47,534 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 03:22:47,535 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 03:22:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:47,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 03:22:47,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:22:47,777 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 03:22:47,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:22:47,944 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 03:22:47,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687701444] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:22:47,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:22:47,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 4] total 17 [2024-10-11 03:22:47,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209854327] [2024-10-11 03:22:47,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:22:47,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 03:22:47,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:22:47,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 03:22:47,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:22:47,946 INFO L87 Difference]: Start difference. First operand 447 states and 599 transitions. Second operand has 17 states, 17 states have (on average 8.764705882352942) internal successors, (149), 17 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 03:22:50,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:22:50,775 INFO L93 Difference]: Finished difference Result 2656 states and 3529 transitions. [2024-10-11 03:22:50,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-11 03:22:50,776 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.764705882352942) internal successors, (149), 17 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 54 [2024-10-11 03:22:50,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:22:50,781 INFO L225 Difference]: With dead ends: 2656 [2024-10-11 03:22:50,782 INFO L226 Difference]: Without dead ends: 2240 [2024-10-11 03:22:50,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=567, Invalid=2403, Unknown=0, NotChecked=0, Total=2970 [2024-10-11 03:22:50,783 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 1032 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:22:50,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 448 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:22:50,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2024-10-11 03:22:50,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 2094. [2024-10-11 03:22:50,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2094 states, 2093 states have (on average 1.2790253225035835) internal successors, (2677), 2093 states have internal predecessors, (2677), 0 states have call successors, (0), 0 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 03:22:50,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 2677 transitions. [2024-10-11 03:22:50,837 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 2677 transitions. Word has length 54 [2024-10-11 03:22:50,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:22:50,837 INFO L471 AbstractCegarLoop]: Abstraction has 2094 states and 2677 transitions. [2024-10-11 03:22:50,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.764705882352942) internal successors, (149), 17 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 03:22:50,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 2677 transitions. [2024-10-11 03:22:50,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 03:22:50,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:22:50,838 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 03:22:50,852 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 03:22:51,039 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,SelfDestructingSolverStorable15 [2024-10-11 03:22:51,039 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:22:51,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:22:51,040 INFO L85 PathProgramCache]: Analyzing trace with hash 122236493, now seen corresponding path program 1 times [2024-10-11 03:22:51,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:22:51,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491535046] [2024-10-11 03:22:51,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:51,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:22:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:51,339 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:22:51,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:22:51,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491535046] [2024-10-11 03:22:51,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491535046] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:22:51,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605688353] [2024-10-11 03:22:51,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:51,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:22:51,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:22:51,341 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 03:22:51,342 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 03:22:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:51,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 03:22:51,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:22:51,667 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 03:22:51,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:22:52,148 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 03:22:52,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605688353] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:22:52,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:22:52,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-10-11 03:22:52,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037425920] [2024-10-11 03:22:52,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:22:52,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 03:22:52,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:22:52,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 03:22:52,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:22:52,151 INFO L87 Difference]: Start difference. First operand 2094 states and 2677 transitions. Second operand has 23 states, 23 states have (on average 5.956521739130435) internal successors, (137), 22 states have internal predecessors, (137), 0 states have call successors, (0), 0 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 03:22:53,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:22:53,488 INFO L93 Difference]: Finished difference Result 9010 states and 11650 transitions. [2024-10-11 03:22:53,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 03:22:53,489 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.956521739130435) internal successors, (137), 22 states have internal predecessors, (137), 0 states have call successors, (0), 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 03:22:53,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:22:53,518 INFO L225 Difference]: With dead ends: 9010 [2024-10-11 03:22:53,518 INFO L226 Difference]: Without dead ends: 7085 [2024-10-11 03:22:53,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=502, Invalid=2048, Unknown=0, NotChecked=0, Total=2550 [2024-10-11 03:22:53,524 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 938 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:22:53,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 566 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:22:53,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7085 states. [2024-10-11 03:22:53,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7085 to 6961. [2024-10-11 03:22:53,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6961 states, 6960 states have (on average 1.2564655172413792) internal successors, (8745), 6960 states have internal predecessors, (8745), 0 states have call successors, (0), 0 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 03:22:53,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6961 states to 6961 states and 8745 transitions. [2024-10-11 03:22:53,792 INFO L78 Accepts]: Start accepts. Automaton has 6961 states and 8745 transitions. Word has length 55 [2024-10-11 03:22:53,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:22:53,793 INFO L471 AbstractCegarLoop]: Abstraction has 6961 states and 8745 transitions. [2024-10-11 03:22:53,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.956521739130435) internal successors, (137), 22 states have internal predecessors, (137), 0 states have call successors, (0), 0 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 03:22:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand 6961 states and 8745 transitions. [2024-10-11 03:22:53,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 03:22:53,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:22:53,794 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] [2024-10-11 03:22:53,806 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 03:22:53,994 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,SelfDestructingSolverStorable16 [2024-10-11 03:22:53,995 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:22:53,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:22:53,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1288816485, now seen corresponding path program 1 times [2024-10-11 03:22:53,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:22:53,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299736921] [2024-10-11 03:22:53,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:53,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:22:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:54,219 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 03:22:54,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:22:54,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299736921] [2024-10-11 03:22:54,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299736921] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:22:54,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924107446] [2024-10-11 03:22:54,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:54,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:22:54,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:22:54,222 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 03:22:54,222 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 03:22:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:54,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 03:22:54,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:22:54,566 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 03:22:54,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:22:54,958 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 03:22:54,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924107446] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:22:54,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:22:54,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-10-11 03:22:54,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551570859] [2024-10-11 03:22:54,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:22:54,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 03:22:54,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:22:54,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 03:22:54,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-10-11 03:22:54,959 INFO L87 Difference]: Start difference. First operand 6961 states and 8745 transitions. Second operand has 19 states, 19 states have (on average 6.526315789473684) internal successors, (124), 18 states have internal predecessors, (124), 0 states have call successors, (0), 0 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 03:22:55,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:22:55,399 INFO L93 Difference]: Finished difference Result 12904 states and 16297 transitions. [2024-10-11 03:22:55,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:22:55,399 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.526315789473684) internal successors, (124), 18 states have internal predecessors, (124), 0 states have call successors, (0), 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 03:22:55,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:22:55,422 INFO L225 Difference]: With dead ends: 12904 [2024-10-11 03:22:55,423 INFO L226 Difference]: Without dead ends: 7337 [2024-10-11 03:22:55,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2024-10-11 03:22:55,428 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 548 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:22:55,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 298 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:22:55,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7337 states. [2024-10-11 03:22:55,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7337 to 6817. [2024-10-11 03:22:55,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6817 states, 6816 states have (on average 1.2397300469483568) internal successors, (8450), 6816 states have internal predecessors, (8450), 0 states have call successors, (0), 0 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 03:22:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6817 states to 6817 states and 8450 transitions. [2024-10-11 03:22:55,676 INFO L78 Accepts]: Start accepts. Automaton has 6817 states and 8450 transitions. Word has length 55 [2024-10-11 03:22:55,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:22:55,676 INFO L471 AbstractCegarLoop]: Abstraction has 6817 states and 8450 transitions. [2024-10-11 03:22:55,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.526315789473684) internal successors, (124), 18 states have internal predecessors, (124), 0 states have call successors, (0), 0 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 03:22:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 6817 states and 8450 transitions. [2024-10-11 03:22:55,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 03:22:55,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:22:55,679 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] [2024-10-11 03:22:55,692 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 03:22:55,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:22:55,880 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:22:55,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:22:55,880 INFO L85 PathProgramCache]: Analyzing trace with hash -769882752, now seen corresponding path program 1 times [2024-10-11 03:22:55,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:22:55,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011145312] [2024-10-11 03:22:55,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:55,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:22:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:56,371 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 03:22:56,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:22:56,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011145312] [2024-10-11 03:22:56,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011145312] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:22:56,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428734243] [2024-10-11 03:22:56,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:56,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:22:56,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:22:56,373 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 03:22:56,375 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 03:22:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:56,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 03:22:56,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:22:56,872 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 03:22:56,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:22:57,801 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 03:22:57,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428734243] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:22:57,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:22:57,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2024-10-11 03:22:57,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663673524] [2024-10-11 03:22:57,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:22:57,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 03:22:57,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:22:57,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 03:22:57,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2024-10-11 03:22:57,803 INFO L87 Difference]: Start difference. First operand 6817 states and 8450 transitions. Second operand has 31 states, 31 states have (on average 4.290322580645161) internal successors, (133), 30 states have internal predecessors, (133), 0 states have call successors, (0), 0 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 03:22:58,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:22:58,580 INFO L93 Difference]: Finished difference Result 10982 states and 13700 transitions. [2024-10-11 03:22:58,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:22:58,580 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.290322580645161) internal successors, (133), 30 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-11 03:22:58,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:22:58,595 INFO L225 Difference]: With dead ends: 10982 [2024-10-11 03:22:58,595 INFO L226 Difference]: Without dead ends: 8037 [2024-10-11 03:22:58,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=334, Invalid=1306, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 03:22:58,601 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 854 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:22:58,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 420 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:22:58,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8037 states. [2024-10-11 03:22:58,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8037 to 5687. [2024-10-11 03:22:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5687 states, 5686 states have (on average 1.231445655997186) internal successors, (7002), 5686 states have internal predecessors, (7002), 0 states have call successors, (0), 0 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 03:22:58,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5687 states to 5687 states and 7002 transitions. [2024-10-11 03:22:58,846 INFO L78 Accepts]: Start accepts. Automaton has 5687 states and 7002 transitions. Word has length 56 [2024-10-11 03:22:58,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:22:58,847 INFO L471 AbstractCegarLoop]: Abstraction has 5687 states and 7002 transitions. [2024-10-11 03:22:58,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.290322580645161) internal successors, (133), 30 states have internal predecessors, (133), 0 states have call successors, (0), 0 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 03:22:58,847 INFO L276 IsEmpty]: Start isEmpty. Operand 5687 states and 7002 transitions. [2024-10-11 03:22:58,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 03:22:58,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:22:58,848 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] [2024-10-11 03:22:58,865 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 03:22:59,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:22:59,048 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:22:59,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:22:59,049 INFO L85 PathProgramCache]: Analyzing trace with hash -297652260, now seen corresponding path program 1 times [2024-10-11 03:22:59,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:22:59,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126387368] [2024-10-11 03:22:59,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:59,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:22:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:59,524 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 03:22:59,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:22:59,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126387368] [2024-10-11 03:22:59,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126387368] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:22:59,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260044924] [2024-10-11 03:22:59,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:59,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:22:59,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:22:59,529 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 03:22:59,530 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 03:22:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:59,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-11 03:22:59,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:23:01,636 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 03:23:01,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:23:03,074 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 03:23:03,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260044924] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:23:03,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:23:03,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 17] total 41 [2024-10-11 03:23:03,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889488365] [2024-10-11 03:23:03,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:23:03,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 03:23:03,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:23:03,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 03:23:03,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1423, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 03:23:03,076 INFO L87 Difference]: Start difference. First operand 5687 states and 7002 transitions. Second operand has 41 states, 41 states have (on average 3.658536585365854) internal successors, (150), 41 states have internal predecessors, (150), 0 states have call successors, (0), 0 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 03:23:10,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:23:10,906 INFO L93 Difference]: Finished difference Result 10831 states and 13576 transitions. [2024-10-11 03:23:10,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-10-11 03:23:10,907 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.658536585365854) internal successors, (150), 41 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-11 03:23:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:23:10,917 INFO L225 Difference]: With dead ends: 10831 [2024-10-11 03:23:10,918 INFO L226 Difference]: Without dead ends: 6679 [2024-10-11 03:23:10,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3195 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=2121, Invalid=8591, Unknown=0, NotChecked=0, Total=10712 [2024-10-11 03:23:10,925 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 1595 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1595 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:23:10,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1595 Valid, 946 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:23:10,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6679 states. [2024-10-11 03:23:11,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6679 to 5891. [2024-10-11 03:23:11,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5891 states, 5890 states have (on average 1.2555178268251272) internal successors, (7395), 5890 states have internal predecessors, (7395), 0 states have call successors, (0), 0 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 03:23:11,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5891 states to 5891 states and 7395 transitions. [2024-10-11 03:23:11,182 INFO L78 Accepts]: Start accepts. Automaton has 5891 states and 7395 transitions. Word has length 56 [2024-10-11 03:23:11,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:23:11,182 INFO L471 AbstractCegarLoop]: Abstraction has 5891 states and 7395 transitions. [2024-10-11 03:23:11,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.658536585365854) internal successors, (150), 41 states have internal predecessors, (150), 0 states have call successors, (0), 0 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 03:23:11,182 INFO L276 IsEmpty]: Start isEmpty. Operand 5891 states and 7395 transitions. [2024-10-11 03:23:11,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:23:11,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:23:11,184 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:23:11,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 03:23:11,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:23:11,389 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:23:11,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:23:11,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1002457202, now seen corresponding path program 1 times [2024-10-11 03:23:11,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:23:11,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893876796] [2024-10-11 03:23:11,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:23:11,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:23:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:23:12,021 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 28 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:23:12,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:23:12,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893876796] [2024-10-11 03:23:12,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893876796] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:23:12,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316122793] [2024-10-11 03:23:12,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:23:12,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:23:12,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:23:12,024 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 03:23:12,037 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 03:23:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:23:12,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 03:23:12,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:23:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 52 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-11 03:23:13,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:23:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 35 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:23:16,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316122793] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:23:16,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:23:16,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 25] total 52 [2024-10-11 03:23:16,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480978774] [2024-10-11 03:23:16,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:23:16,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-11 03:23:16,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:23:16,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-11 03:23:16,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=2392, Unknown=0, NotChecked=0, Total=2652 [2024-10-11 03:23:16,788 INFO L87 Difference]: Start difference. First operand 5891 states and 7395 transitions. Second operand has 52 states, 52 states have (on average 4.5) internal successors, (234), 52 states have internal predecessors, (234), 0 states have call successors, (0), 0 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 03:23:38,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:23:38,917 INFO L93 Difference]: Finished difference Result 12379 states and 15683 transitions. [2024-10-11 03:23:38,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2024-10-11 03:23:38,918 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 4.5) internal successors, (234), 52 states have internal predecessors, (234), 0 states have call successors, (0), 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 92 [2024-10-11 03:23:38,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:23:38,933 INFO L225 Difference]: With dead ends: 12379 [2024-10-11 03:23:38,933 INFO L226 Difference]: Without dead ends: 8031 [2024-10-11 03:23:38,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9045 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=3479, Invalid=26623, Unknown=0, NotChecked=0, Total=30102 [2024-10-11 03:23:38,944 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 3338 mSDsluCounter, 2651 mSDsCounter, 0 mSdLazyCounter, 2927 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3338 SdHoareTripleChecker+Valid, 2801 SdHoareTripleChecker+Invalid, 3061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 2927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:23:38,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3338 Valid, 2801 Invalid, 3061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 2927 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 03:23:38,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8031 states. [2024-10-11 03:23:39,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8031 to 6347. [2024-10-11 03:23:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6347 states, 6346 states have (on average 1.2388906397730854) internal successors, (7862), 6346 states have internal predecessors, (7862), 0 states have call successors, (0), 0 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 03:23:39,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6347 states to 6347 states and 7862 transitions. [2024-10-11 03:23:39,339 INFO L78 Accepts]: Start accepts. Automaton has 6347 states and 7862 transitions. Word has length 92 [2024-10-11 03:23:39,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:23:39,339 INFO L471 AbstractCegarLoop]: Abstraction has 6347 states and 7862 transitions. [2024-10-11 03:23:39,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.5) internal successors, (234), 52 states have internal predecessors, (234), 0 states have call successors, (0), 0 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 03:23:39,340 INFO L276 IsEmpty]: Start isEmpty. Operand 6347 states and 7862 transitions. [2024-10-11 03:23:39,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:23:39,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:23:39,342 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:23:39,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 03:23:39,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-11 03:23:39,543 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:23:39,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:23:39,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2109879898, now seen corresponding path program 1 times [2024-10-11 03:23:39,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:23:39,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568844668] [2024-10-11 03:23:39,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:23:39,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:23:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:23:40,252 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 37 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:23:40,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:23:40,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568844668] [2024-10-11 03:23:40,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568844668] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:23:40,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129676925] [2024-10-11 03:23:40,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:23:40,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:23:40,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:23:40,254 INFO L229 MonitoredProcess]: Starting monitored process 8 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 03:23:40,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 03:23:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:23:40,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-11 03:23:40,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:23:41,610 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:23:41,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:23:45,695 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:23:45,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129676925] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:23:45,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:23:45,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22, 23] total 58 [2024-10-11 03:23:45,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103280678] [2024-10-11 03:23:45,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:23:45,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-10-11 03:23:45,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:23:45,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-10-11 03:23:45,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=3146, Unknown=0, NotChecked=0, Total=3422 [2024-10-11 03:23:45,698 INFO L87 Difference]: Start difference. First operand 6347 states and 7862 transitions. Second operand has 59 states, 59 states have (on average 4.491525423728813) internal successors, (265), 58 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)