./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-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.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-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.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 66c207afdf75651c63b981596e8f017960ef7c36414078ce8f63e7be229e927f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:55:23,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:55:23,821 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:55:23,827 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:55:23,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:55:23,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:55:23,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:55:23,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:55:23,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:55:23,856 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:55:23,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:55:23,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:55:23,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:55:23,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:55:23,858 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:55:23,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:55:23,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:55:23,862 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:55:23,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:55:23,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:55:23,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:55:23,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:55:23,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:55:23,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:55:23,868 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:55:23,868 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:55:23,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:55:23,869 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:55:23,869 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:55:23,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:55:23,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:55:23,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:55:23,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:55:23,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:55:23,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:55:23,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:55:23,873 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:55:23,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:55:23,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:55:23,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:55:23,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:55:23,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:55:23,875 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 -> 66c207afdf75651c63b981596e8f017960ef7c36414078ce8f63e7be229e927f [2024-10-11 03:55:24,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:55:24,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:55:24,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:55:24,205 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:55:24,206 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:55:24,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-11 03:55:25,739 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:55:26,042 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:55:26,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-11 03:55:26,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5841b2a05/823e47c3838048daa7506ddb52c64351/FLAG81f46189a [2024-10-11 03:55:26,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5841b2a05/823e47c3838048daa7506ddb52c64351 [2024-10-11 03:55:26,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:55:26,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:55:26,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:55:26,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:55:26,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:55:26,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:55:26" (1/1) ... [2024-10-11 03:55:26,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2df6fded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:55:26, skipping insertion in model container [2024-10-11 03:55:26,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:55:26" (1/1) ... [2024-10-11 03:55:26,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:55:26,707 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-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26611,26624] [2024-10-11 03:55:26,747 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-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30833,30846] [2024-10-11 03:55:26,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:55:26,944 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:55:27,112 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-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26611,26624] [2024-10-11 03:55:27,152 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-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30833,30846] [2024-10-11 03:55:27,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:55:27,266 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:55:27,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:55:27 WrapperNode [2024-10-11 03:55:27,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:55:27,269 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:55:27,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:55:27,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:55:27,277 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:55:27" (1/1) ... [2024-10-11 03:55:27,320 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:55:27" (1/1) ... [2024-10-11 03:55:27,427 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2716 [2024-10-11 03:55:27,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:55:27,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:55:27,428 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:55:27,428 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:55:27,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:55:27" (1/1) ... [2024-10-11 03:55:27,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:55:27" (1/1) ... [2024-10-11 03:55:27,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:55:27" (1/1) ... [2024-10-11 03:55:27,492 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:55:27,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:55:27" (1/1) ... [2024-10-11 03:55:27,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:55:27" (1/1) ... [2024-10-11 03:55:27,526 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:55:27" (1/1) ... [2024-10-11 03:55:27,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:55:27" (1/1) ... [2024-10-11 03:55:27,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:55:27" (1/1) ... [2024-10-11 03:55:27,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:55:27" (1/1) ... [2024-10-11 03:55:27,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:55:27,601 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:55:27,601 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:55:27,602 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:55:27,602 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:55:27" (1/1) ... [2024-10-11 03:55:27,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:55:27,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:55:27,637 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:55:27,640 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:55:27,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:55:27,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:55:27,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:55:27,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:55:27,868 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:55:27,871 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:55:30,151 INFO L? ?]: Removed 187 outVars from TransFormulas that were not future-live. [2024-10-11 03:55:30,152 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:55:30,256 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:55:30,258 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:55:30,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:55:30 BoogieIcfgContainer [2024-10-11 03:55:30,258 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:55:30,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:55:30,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:55:30,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:55:30,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:55:26" (1/3) ... [2024-10-11 03:55:30,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e986c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:55:30, skipping insertion in model container [2024-10-11 03:55:30,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:55:27" (2/3) ... [2024-10-11 03:55:30,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e986c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:55:30, skipping insertion in model container [2024-10-11 03:55:30,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:55:30" (3/3) ... [2024-10-11 03:55:30,272 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-11 03:55:30,290 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:55:30,290 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 03:55:30,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:55:30,392 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;@6a070712, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:55:30,393 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 03:55:30,405 INFO L276 IsEmpty]: Start isEmpty. Operand has 683 states, 680 states have (on average 1.7955882352941177) internal successors, (1221), 682 states have internal predecessors, (1221), 0 states have call successors, (0), 0 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:55:30,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-11 03:55:30,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:55:30,434 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:30,435 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:55:30,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:55:30,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1574780565, now seen corresponding path program 1 times [2024-10-11 03:55:30,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:55:30,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879792114] [2024-10-11 03:55:30,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:55:30,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:55:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:55:32,417 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:55:32,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:55:32,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879792114] [2024-10-11 03:55:32,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879792114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:55:32,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:55:32,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:55:32,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473854616] [2024-10-11 03:55:32,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:55:32,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:55:32,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:55:32,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:55:32,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:55:32,476 INFO L87 Difference]: Start difference. First operand has 683 states, 680 states have (on average 1.7955882352941177) internal successors, (1221), 682 states have internal predecessors, (1221), 0 states have call successors, (0), 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 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 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:55:32,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:55:32,825 INFO L93 Difference]: Finished difference Result 2621 states and 4688 transitions. [2024-10-11 03:55:32,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:55:32,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 246 [2024-10-11 03:55:32,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:55:32,860 INFO L225 Difference]: With dead ends: 2621 [2024-10-11 03:55:32,860 INFO L226 Difference]: Without dead ends: 1979 [2024-10-11 03:55:32,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:55:32,872 INFO L432 NwaCegarLoop]: 1829 mSDtfsCounter, 2258 mSDsluCounter, 2288 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2258 SdHoareTripleChecker+Valid, 4117 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:55:32,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2258 Valid, 4117 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:55:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2024-10-11 03:55:32,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1297. [2024-10-11 03:55:32,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 1295 states have (on average 1.5644787644787645) internal successors, (2026), 1296 states have internal predecessors, (2026), 0 states have call successors, (0), 0 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:55:32,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 2026 transitions. [2024-10-11 03:55:32,988 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 2026 transitions. Word has length 246 [2024-10-11 03:55:32,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:55:32,989 INFO L471 AbstractCegarLoop]: Abstraction has 1297 states and 2026 transitions. [2024-10-11 03:55:32,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 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:55:32,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 2026 transitions. [2024-10-11 03:55:32,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-11 03:55:32,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:55:32,998 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:32,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:55:32,998 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:55:32,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:55:32,999 INFO L85 PathProgramCache]: Analyzing trace with hash 2023805797, now seen corresponding path program 1 times [2024-10-11 03:55:32,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:55:33,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104942045] [2024-10-11 03:55:33,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:55:33,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:55:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:55:33,287 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:55:33,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:55:33,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104942045] [2024-10-11 03:55:33,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104942045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:55:33,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:55:33,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:55:33,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102898460] [2024-10-11 03:55:33,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:55:33,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:55:33,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:55:33,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:55:33,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:55:33,291 INFO L87 Difference]: Start difference. First operand 1297 states and 2026 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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:55:33,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:55:33,424 INFO L93 Difference]: Finished difference Result 3721 states and 5775 transitions. [2024-10-11 03:55:33,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:55:33,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 248 [2024-10-11 03:55:33,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:55:33,438 INFO L225 Difference]: With dead ends: 3721 [2024-10-11 03:55:33,438 INFO L226 Difference]: Without dead ends: 2548 [2024-10-11 03:55:33,442 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:55:33,443 INFO L432 NwaCegarLoop]: 2067 mSDtfsCounter, 928 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 3080 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:55:33,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 3080 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:55:33,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2024-10-11 03:55:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2512. [2024-10-11 03:55:33,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2512 states, 2510 states have (on average 1.556573705179283) internal successors, (3907), 2511 states have internal predecessors, (3907), 0 states have call successors, (0), 0 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:55:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2512 states to 2512 states and 3907 transitions. [2024-10-11 03:55:33,517 INFO L78 Accepts]: Start accepts. Automaton has 2512 states and 3907 transitions. Word has length 248 [2024-10-11 03:55:33,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:55:33,518 INFO L471 AbstractCegarLoop]: Abstraction has 2512 states and 3907 transitions. [2024-10-11 03:55:33,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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:55:33,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 3907 transitions. [2024-10-11 03:55:33,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-11 03:55:33,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:55:33,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:33,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:55:33,548 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:55:33,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:55:33,552 INFO L85 PathProgramCache]: Analyzing trace with hash -317462976, now seen corresponding path program 1 times [2024-10-11 03:55:33,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:55:33,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678110430] [2024-10-11 03:55:33,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:55:33,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:55:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:55:33,768 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:55:33,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:55:33,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678110430] [2024-10-11 03:55:33,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678110430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:55:33,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:55:33,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:55:33,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394363161] [2024-10-11 03:55:33,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:55:33,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:55:33,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:55:33,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:55:33,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:55:33,773 INFO L87 Difference]: Start difference. First operand 2512 states and 3907 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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:55:33,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:55:33,857 INFO L93 Difference]: Finished difference Result 7471 states and 11602 transitions. [2024-10-11 03:55:33,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:55:33,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 248 [2024-10-11 03:55:33,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:55:33,880 INFO L225 Difference]: With dead ends: 7471 [2024-10-11 03:55:33,881 INFO L226 Difference]: Without dead ends: 4996 [2024-10-11 03:55:33,891 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:55:33,893 INFO L432 NwaCegarLoop]: 2110 mSDtfsCounter, 1053 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 3163 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:55:33,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 3163 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:55:33,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4996 states. [2024-10-11 03:55:33,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4996 to 2531. [2024-10-11 03:55:33,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2531 states, 2529 states have (on average 1.5563463819691579) internal successors, (3936), 2530 states have internal predecessors, (3936), 0 states have call successors, (0), 0 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:55:33,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 3936 transitions. [2024-10-11 03:55:34,000 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 3936 transitions. Word has length 248 [2024-10-11 03:55:34,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:55:34,004 INFO L471 AbstractCegarLoop]: Abstraction has 2531 states and 3936 transitions. [2024-10-11 03:55:34,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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:55:34,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 3936 transitions. [2024-10-11 03:55:34,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-11 03:55:34,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:55:34,011 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:34,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:55:34,012 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:55:34,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:55:34,013 INFO L85 PathProgramCache]: Analyzing trace with hash -561799979, now seen corresponding path program 1 times [2024-10-11 03:55:34,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:55:34,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980736] [2024-10-11 03:55:34,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:55:34,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:55:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:55:34,188 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:55:34,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:55:34,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980736] [2024-10-11 03:55:34,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:55:34,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:55:34,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:55:34,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301770455] [2024-10-11 03:55:34,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:55:34,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:55:34,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:55:34,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:55:34,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:55:34,191 INFO L87 Difference]: Start difference. First operand 2531 states and 3936 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 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:55:34,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:55:34,244 INFO L93 Difference]: Finished difference Result 5025 states and 7803 transitions. [2024-10-11 03:55:34,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:55:34,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 249 [2024-10-11 03:55:34,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:55:34,254 INFO L225 Difference]: With dead ends: 5025 [2024-10-11 03:55:34,255 INFO L226 Difference]: Without dead ends: 2549 [2024-10-11 03:55:34,258 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:55:34,259 INFO L432 NwaCegarLoop]: 1075 mSDtfsCounter, 5 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2136 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:55:34,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2136 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:55:34,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2024-10-11 03:55:34,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2549. [2024-10-11 03:55:34,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2549 states, 2547 states have (on average 1.5535924617196701) internal successors, (3957), 2548 states have internal predecessors, (3957), 0 states have call successors, (0), 0 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:55:34,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 3957 transitions. [2024-10-11 03:55:34,358 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 3957 transitions. Word has length 249 [2024-10-11 03:55:34,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:55:34,359 INFO L471 AbstractCegarLoop]: Abstraction has 2549 states and 3957 transitions. [2024-10-11 03:55:34,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 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:55:34,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 3957 transitions. [2024-10-11 03:55:34,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-11 03:55:34,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:55:34,366 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:34,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:55:34,366 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:55:34,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:55:34,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1606180950, now seen corresponding path program 1 times [2024-10-11 03:55:34,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:55:34,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853323602] [2024-10-11 03:55:34,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:55:34,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:55:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:55:34,590 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:55:34,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:55:34,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853323602] [2024-10-11 03:55:34,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853323602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:55:34,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:55:34,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:55:34,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485763943] [2024-10-11 03:55:34,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:55:34,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:55:34,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:55:34,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:55:34,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:55:34,593 INFO L87 Difference]: Start difference. First operand 2549 states and 3957 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 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:55:34,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:55:34,723 INFO L93 Difference]: Finished difference Result 7221 states and 11137 transitions. [2024-10-11 03:55:34,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:55:34,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2024-10-11 03:55:34,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:55:34,744 INFO L225 Difference]: With dead ends: 7221 [2024-10-11 03:55:34,744 INFO L226 Difference]: Without dead ends: 4912 [2024-10-11 03:55:34,751 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:55:34,752 INFO L432 NwaCegarLoop]: 2072 mSDtfsCounter, 922 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 3085 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:55:34,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 3085 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:55:34,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4912 states. [2024-10-11 03:55:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4912 to 4878. [2024-10-11 03:55:34,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4878 states, 4876 states have (on average 1.5418375717801476) internal successors, (7518), 4877 states have internal predecessors, (7518), 0 states have call successors, (0), 0 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:55:34,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 7518 transitions. [2024-10-11 03:55:34,875 INFO L78 Accepts]: Start accepts. Automaton has 4878 states and 7518 transitions. Word has length 250 [2024-10-11 03:55:34,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:55:34,877 INFO L471 AbstractCegarLoop]: Abstraction has 4878 states and 7518 transitions. [2024-10-11 03:55:34,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 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:55:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 4878 states and 7518 transitions. [2024-10-11 03:55:34,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-11 03:55:34,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:55:34,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:34,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:55:34,887 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:55:34,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:55:34,888 INFO L85 PathProgramCache]: Analyzing trace with hash -314381267, now seen corresponding path program 1 times [2024-10-11 03:55:34,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:55:34,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226733646] [2024-10-11 03:55:34,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:55:34,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:55:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:55:35,795 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:55:35,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:55:35,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226733646] [2024-10-11 03:55:35,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226733646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:55:35,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:55:35,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:55:35,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596501502] [2024-10-11 03:55:35,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:55:35,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:55:35,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:55:35,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:55:35,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:55:35,798 INFO L87 Difference]: Start difference. First operand 4878 states and 7518 transitions. Second operand has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 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:55:36,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:55:36,030 INFO L93 Difference]: Finished difference Result 18595 states and 28518 transitions. [2024-10-11 03:55:36,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:55:36,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2024-10-11 03:55:36,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:55:36,101 INFO L225 Difference]: With dead ends: 18595 [2024-10-11 03:55:36,101 INFO L226 Difference]: Without dead ends: 13892 [2024-10-11 03:55:36,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:55:36,117 INFO L432 NwaCegarLoop]: 1898 mSDtfsCounter, 1963 mSDsluCounter, 2333 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1963 SdHoareTripleChecker+Valid, 4231 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:55:36,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1963 Valid, 4231 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:55:36,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13892 states. [2024-10-11 03:55:36,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13892 to 9378. [2024-10-11 03:55:36,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9378 states, 9376 states have (on average 1.5277303754266212) internal successors, (14324), 9377 states have internal predecessors, (14324), 0 states have call successors, (0), 0 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:55:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9378 states to 9378 states and 14324 transitions. [2024-10-11 03:55:36,435 INFO L78 Accepts]: Start accepts. Automaton has 9378 states and 14324 transitions. Word has length 250 [2024-10-11 03:55:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:55:36,436 INFO L471 AbstractCegarLoop]: Abstraction has 9378 states and 14324 transitions. [2024-10-11 03:55:36,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 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:55:36,436 INFO L276 IsEmpty]: Start isEmpty. Operand 9378 states and 14324 transitions. [2024-10-11 03:55:36,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-10-11 03:55:36,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:55:36,454 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:36,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:55:36,455 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:55:36,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:55:36,456 INFO L85 PathProgramCache]: Analyzing trace with hash 511766591, now seen corresponding path program 1 times [2024-10-11 03:55:36,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:55:36,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741074136] [2024-10-11 03:55:36,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:55:36,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:55:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:55:37,410 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:55:37,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:55:37,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741074136] [2024-10-11 03:55:37,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741074136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:55:37,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:55:37,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:55:37,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300880074] [2024-10-11 03:55:37,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:55:37,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:55:37,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:55:37,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:55:37,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:55:37,413 INFO L87 Difference]: Start difference. First operand 9378 states and 14324 transitions. Second operand has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 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:55:37,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:55:37,604 INFO L93 Difference]: Finished difference Result 27161 states and 41289 transitions. [2024-10-11 03:55:37,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:55:37,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 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 252 [2024-10-11 03:55:37,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:55:37,646 INFO L225 Difference]: With dead ends: 27161 [2024-10-11 03:55:37,647 INFO L226 Difference]: Without dead ends: 18616 [2024-10-11 03:55:37,664 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:55:37,665 INFO L432 NwaCegarLoop]: 2099 mSDtfsCounter, 1010 mSDsluCounter, 3153 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 5252 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:55:37,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 5252 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:55:37,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18616 states. [2024-10-11 03:55:37,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18616 to 10295. [2024-10-11 03:55:38,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10295 states, 10293 states have (on average 1.5442533760808317) internal successors, (15895), 10294 states have internal predecessors, (15895), 0 states have call successors, (0), 0 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:55:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10295 states to 10295 states and 15895 transitions. [2024-10-11 03:55:38,052 INFO L78 Accepts]: Start accepts. Automaton has 10295 states and 15895 transitions. Word has length 252 [2024-10-11 03:55:38,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:55:38,053 INFO L471 AbstractCegarLoop]: Abstraction has 10295 states and 15895 transitions. [2024-10-11 03:55:38,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 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:55:38,053 INFO L276 IsEmpty]: Start isEmpty. Operand 10295 states and 15895 transitions. [2024-10-11 03:55:38,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-10-11 03:55:38,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:55:38,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:38,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:55:38,071 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:55:38,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:55:38,071 INFO L85 PathProgramCache]: Analyzing trace with hash -327057359, now seen corresponding path program 1 times [2024-10-11 03:55:38,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:55:38,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319666100] [2024-10-11 03:55:38,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:55:38,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:55:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:55:38,269 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:55:38,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:55:38,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319666100] [2024-10-11 03:55:38,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319666100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:55:38,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:55:38,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:55:38,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975980585] [2024-10-11 03:55:38,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:55:38,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:55:38,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:55:38,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:55:38,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:55:38,273 INFO L87 Difference]: Start difference. First operand 10295 states and 15895 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 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:55:38,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:55:38,456 INFO L93 Difference]: Finished difference Result 28989 states and 44447 transitions. [2024-10-11 03:55:38,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:55:38,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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 252 [2024-10-11 03:55:38,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:55:38,502 INFO L225 Difference]: With dead ends: 28989 [2024-10-11 03:55:38,503 INFO L226 Difference]: Without dead ends: 19808 [2024-10-11 03:55:38,522 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:55:38,524 INFO L432 NwaCegarLoop]: 2058 mSDtfsCounter, 909 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 3071 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:55:38,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 3071 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:55:38,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19808 states. [2024-10-11 03:55:38,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19808 to 19784. [2024-10-11 03:55:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19784 states, 19782 states have (on average 1.5305833586088362) internal successors, (30278), 19783 states have internal predecessors, (30278), 0 states have call successors, (0), 0 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:55:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19784 states to 19784 states and 30278 transitions. [2024-10-11 03:55:39,048 INFO L78 Accepts]: Start accepts. Automaton has 19784 states and 30278 transitions. Word has length 252 [2024-10-11 03:55:39,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:55:39,048 INFO L471 AbstractCegarLoop]: Abstraction has 19784 states and 30278 transitions. [2024-10-11 03:55:39,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 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:55:39,049 INFO L276 IsEmpty]: Start isEmpty. Operand 19784 states and 30278 transitions. [2024-10-11 03:55:39,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-10-11 03:55:39,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:55:39,082 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:39,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:55:39,083 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:55:39,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:55:39,083 INFO L85 PathProgramCache]: Analyzing trace with hash -825282414, now seen corresponding path program 1 times [2024-10-11 03:55:39,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:55:39,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383535186] [2024-10-11 03:55:39,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:55:39,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:55:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:55:39,259 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:55:39,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:55:39,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383535186] [2024-10-11 03:55:39,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383535186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:55:39,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:55:39,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:55:39,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443481827] [2024-10-11 03:55:39,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:55:39,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:55:39,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:55:39,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:55:39,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:55:39,263 INFO L87 Difference]: Start difference. First operand 19784 states and 30278 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 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:55:39,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:55:39,472 INFO L93 Difference]: Finished difference Result 39155 states and 60118 transitions. [2024-10-11 03:55:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:55:39,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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 252 [2024-10-11 03:55:39,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:55:39,533 INFO L225 Difference]: With dead ends: 39155 [2024-10-11 03:55:39,533 INFO L226 Difference]: Without dead ends: 26370 [2024-10-11 03:55:39,561 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:55:39,561 INFO L432 NwaCegarLoop]: 1422 mSDtfsCounter, 547 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 2275 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:55:39,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 2275 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:55:39,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26370 states. [2024-10-11 03:55:40,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26370 to 23600. [2024-10-11 03:55:40,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23600 states, 23598 states have (on average 1.5464869904229173) internal successors, (36494), 23599 states have internal predecessors, (36494), 0 states have call successors, (0), 0 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:55:40,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23600 states to 23600 states and 36494 transitions. [2024-10-11 03:55:40,383 INFO L78 Accepts]: Start accepts. Automaton has 23600 states and 36494 transitions. Word has length 252 [2024-10-11 03:55:40,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:55:40,384 INFO L471 AbstractCegarLoop]: Abstraction has 23600 states and 36494 transitions. [2024-10-11 03:55:40,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 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:55:40,384 INFO L276 IsEmpty]: Start isEmpty. Operand 23600 states and 36494 transitions. [2024-10-11 03:55:40,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-10-11 03:55:40,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:55:40,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:40,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:55:40,418 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:55:40,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:55:40,419 INFO L85 PathProgramCache]: Analyzing trace with hash 511704689, now seen corresponding path program 1 times [2024-10-11 03:55:40,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:55:40,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394421404] [2024-10-11 03:55:40,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:55:40,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:55:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:55:40,555 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:55:40,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:55:40,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394421404] [2024-10-11 03:55:40,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394421404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:55:40,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:55:40,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:55:40,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200626687] [2024-10-11 03:55:40,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:55:40,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:55:40,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:55:40,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:55:40,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:55:40,559 INFO L87 Difference]: Start difference. First operand 23600 states and 36494 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 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:55:40,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:55:40,990 INFO L93 Difference]: Finished difference Result 64818 states and 99112 transitions. [2024-10-11 03:55:40,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:55:40,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2024-10-11 03:55:40,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:55:41,110 INFO L225 Difference]: With dead ends: 64818 [2024-10-11 03:55:41,111 INFO L226 Difference]: Without dead ends: 44225 [2024-10-11 03:55:41,156 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:55:41,157 INFO L432 NwaCegarLoop]: 1062 mSDtfsCounter, 911 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:55:41,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 2117 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:55:41,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44225 states. [2024-10-11 03:55:41,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44225 to 24080. [2024-10-11 03:55:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24080 states, 24078 states have (on average 1.5429022344048509) internal successors, (37150), 24079 states have internal predecessors, (37150), 0 states have call successors, (0), 0 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:55:41,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24080 states to 24080 states and 37150 transitions. [2024-10-11 03:55:41,764 INFO L78 Accepts]: Start accepts. Automaton has 24080 states and 37150 transitions. Word has length 254 [2024-10-11 03:55:41,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:55:41,922 INFO L471 AbstractCegarLoop]: Abstraction has 24080 states and 37150 transitions. [2024-10-11 03:55:41,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 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:55:41,927 INFO L276 IsEmpty]: Start isEmpty. Operand 24080 states and 37150 transitions. [2024-10-11 03:55:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-10-11 03:55:41,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:55:41,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:41,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:55:41,975 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:55:41,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:55:41,976 INFO L85 PathProgramCache]: Analyzing trace with hash 328503254, now seen corresponding path program 1 times [2024-10-11 03:55:41,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:55:41,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039808997] [2024-10-11 03:55:41,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:55:41,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:55:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:55:42,215 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:55:42,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:55:42,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039808997] [2024-10-11 03:55:42,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039808997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:55:42,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:55:42,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:55:42,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720018466] [2024-10-11 03:55:42,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:55:42,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:55:42,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:55:42,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:55:42,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:55:42,220 INFO L87 Difference]: Start difference. First operand 24080 states and 37150 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 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:55:42,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:55:42,606 INFO L93 Difference]: Finished difference Result 66040 states and 100828 transitions. [2024-10-11 03:55:42,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:55:42,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2024-10-11 03:55:42,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:55:42,699 INFO L225 Difference]: With dead ends: 66040 [2024-10-11 03:55:42,699 INFO L226 Difference]: Without dead ends: 45159 [2024-10-11 03:55:42,723 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:55:42,724 INFO L432 NwaCegarLoop]: 2046 mSDtfsCounter, 941 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 3056 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:55:42,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 3056 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:55:42,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45159 states. [2024-10-11 03:55:43,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45159 to 45132. [2024-10-11 03:55:43,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45132 states, 45130 states have (on average 1.522490582760913) internal successors, (68710), 45131 states have internal predecessors, (68710), 0 states have call successors, (0), 0 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:55:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45132 states to 45132 states and 68710 transitions. [2024-10-11 03:55:43,555 INFO L78 Accepts]: Start accepts. Automaton has 45132 states and 68710 transitions. Word has length 254 [2024-10-11 03:55:43,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:55:43,555 INFO L471 AbstractCegarLoop]: Abstraction has 45132 states and 68710 transitions. [2024-10-11 03:55:43,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 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:55:43,556 INFO L276 IsEmpty]: Start isEmpty. Operand 45132 states and 68710 transitions. [2024-10-11 03:55:43,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-10-11 03:55:43,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:55:43,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:43,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:55:43,600 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:55:43,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:55:43,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1186931486, now seen corresponding path program 1 times [2024-10-11 03:55:43,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:55:43,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897478662] [2024-10-11 03:55:43,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:55:43,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:55:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:55:43,967 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:55:43,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:55:43,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897478662] [2024-10-11 03:55:43,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897478662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:55:43,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:55:43,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:55:43,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961812144] [2024-10-11 03:55:43,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:55:43,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:55:43,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:55:43,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:55:43,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:55:43,971 INFO L87 Difference]: Start difference. First operand 45132 states and 68710 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:55:44,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:55:44,311 INFO L93 Difference]: Finished difference Result 86697 states and 131457 transitions. [2024-10-11 03:55:44,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:55:44,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 255 [2024-10-11 03:55:44,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:55:44,399 INFO L225 Difference]: With dead ends: 86697 [2024-10-11 03:55:44,400 INFO L226 Difference]: Without dead ends: 46232 [2024-10-11 03:55:44,450 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:55:44,451 INFO L432 NwaCegarLoop]: 1072 mSDtfsCounter, 7 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:55:44,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2129 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:55:44,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46232 states. [2024-10-11 03:55:45,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46232 to 46232. [2024-10-11 03:55:45,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46232 states, 46230 states have (on average 1.5149037421587714) internal successors, (70034), 46231 states have internal predecessors, (70034), 0 states have call successors, (0), 0 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:55:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46232 states to 46232 states and 70034 transitions. [2024-10-11 03:55:45,215 INFO L78 Accepts]: Start accepts. Automaton has 46232 states and 70034 transitions. Word has length 255 [2024-10-11 03:55:45,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:55:45,215 INFO L471 AbstractCegarLoop]: Abstraction has 46232 states and 70034 transitions. [2024-10-11 03:55:45,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:55:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 46232 states and 70034 transitions. [2024-10-11 03:55:45,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-11 03:55:45,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:55:45,551 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:45,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:55:45,552 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:55:45,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:55:45,552 INFO L85 PathProgramCache]: Analyzing trace with hash -117715554, now seen corresponding path program 1 times [2024-10-11 03:55:45,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:55:45,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069588333] [2024-10-11 03:55:45,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:55:45,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:55:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:55:46,424 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:55:46,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:55:46,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069588333] [2024-10-11 03:55:46,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069588333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:55:46,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:55:46,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:55:46,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814880182] [2024-10-11 03:55:46,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:55:46,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:55:46,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:55:46,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:55:46,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:55:46,428 INFO L87 Difference]: Start difference. First operand 46232 states and 70034 transitions. Second operand has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 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:55:46,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:55:46,734 INFO L93 Difference]: Finished difference Result 81607 states and 123264 transitions. [2024-10-11 03:55:46,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:55:46,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 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 256 [2024-10-11 03:55:46,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:55:46,933 INFO L225 Difference]: With dead ends: 81607 [2024-10-11 03:55:46,934 INFO L226 Difference]: Without dead ends: 40990 [2024-10-11 03:55:46,968 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:55:46,970 INFO L432 NwaCegarLoop]: 1189 mSDtfsCounter, 90 mSDsluCounter, 2245 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 3434 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:55:46,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 3434 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:55:47,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40990 states. [2024-10-11 03:55:47,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40990 to 40662. [2024-10-11 03:55:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40662 states, 40660 states have (on average 1.5129611411706838) internal successors, (61517), 40661 states have internal predecessors, (61517), 0 states have call successors, (0), 0 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:55:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40662 states to 40662 states and 61517 transitions. [2024-10-11 03:55:47,629 INFO L78 Accepts]: Start accepts. Automaton has 40662 states and 61517 transitions. Word has length 256 [2024-10-11 03:55:47,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:55:47,630 INFO L471 AbstractCegarLoop]: Abstraction has 40662 states and 61517 transitions. [2024-10-11 03:55:47,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 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:55:47,630 INFO L276 IsEmpty]: Start isEmpty. Operand 40662 states and 61517 transitions. [2024-10-11 03:55:47,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-11 03:55:47,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:55:47,675 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:47,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:55:47,675 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:55:47,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:55:47,676 INFO L85 PathProgramCache]: Analyzing trace with hash 347284026, now seen corresponding path program 1 times [2024-10-11 03:55:47,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:55:47,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854067257] [2024-10-11 03:55:47,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:55:47,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:55:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:55:47,880 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:55:47,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:55:47,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854067257] [2024-10-11 03:55:47,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854067257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:55:47,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:55:47,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:55:47,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833957612] [2024-10-11 03:55:47,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:55:47,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:55:47,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:55:47,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:55:47,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:55:47,883 INFO L87 Difference]: Start difference. First operand 40662 states and 61517 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 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:55:48,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:55:48,439 INFO L93 Difference]: Finished difference Result 82389 states and 126467 transitions. [2024-10-11 03:55:48,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:55:48,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 256 [2024-10-11 03:55:48,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:55:48,527 INFO L225 Difference]: With dead ends: 82389 [2024-10-11 03:55:48,528 INFO L226 Difference]: Without dead ends: 56718 [2024-10-11 03:55:48,569 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:55:48,570 INFO L432 NwaCegarLoop]: 1415 mSDtfsCounter, 569 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:55:48,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 2220 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:55:48,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56718 states. [2024-10-11 03:55:49,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56718 to 52578. [2024-10-11 03:55:49,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52578 states, 52576 states have (on average 1.5352442178940962) internal successors, (80717), 52577 states have internal predecessors, (80717), 0 states have call successors, (0), 0 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:55:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52578 states to 52578 states and 80717 transitions. [2024-10-11 03:55:49,426 INFO L78 Accepts]: Start accepts. Automaton has 52578 states and 80717 transitions. Word has length 256 [2024-10-11 03:55:49,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:55:49,427 INFO L471 AbstractCegarLoop]: Abstraction has 52578 states and 80717 transitions. [2024-10-11 03:55:49,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 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:55:49,427 INFO L276 IsEmpty]: Start isEmpty. Operand 52578 states and 80717 transitions. [2024-10-11 03:55:49,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-10-11 03:55:49,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:55:49,465 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:49,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:55:49,466 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:55:49,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:55:49,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1041811905, now seen corresponding path program 1 times [2024-10-11 03:55:49,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:55:49,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738920689] [2024-10-11 03:55:49,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:55:49,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:55:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:55:50,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:55:50,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:55:50,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738920689] [2024-10-11 03:55:50,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738920689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:55:50,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:55:50,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:55:50,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739779620] [2024-10-11 03:55:50,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:55:50,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:55:50,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:55:50,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:55:50,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:55:50,523 INFO L87 Difference]: Start difference. First operand 52578 states and 80717 transitions. Second operand has 5 states, 5 states have (on average 51.4) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 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:55:51,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:55:51,069 INFO L93 Difference]: Finished difference Result 152176 states and 233118 transitions. [2024-10-11 03:55:51,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:55:51,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 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 257 [2024-10-11 03:55:51,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:55:51,300 INFO L225 Difference]: With dead ends: 152176 [2024-10-11 03:55:51,300 INFO L226 Difference]: Without dead ends: 99809 [2024-10-11 03:55:51,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:55:51,392 INFO L432 NwaCegarLoop]: 1741 mSDtfsCounter, 941 mSDsluCounter, 3699 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 5440 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:55:51,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 5440 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:55:51,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99809 states. [2024-10-11 03:55:52,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99809 to 99791. [2024-10-11 03:55:52,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99791 states, 99789 states have (on average 1.5220014230025354) internal successors, (151879), 99790 states have internal predecessors, (151879), 0 states have call successors, (0), 0 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:55:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99791 states to 99791 states and 151879 transitions. [2024-10-11 03:55:53,539 INFO L78 Accepts]: Start accepts. Automaton has 99791 states and 151879 transitions. Word has length 257 [2024-10-11 03:55:53,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:55:53,540 INFO L471 AbstractCegarLoop]: Abstraction has 99791 states and 151879 transitions. [2024-10-11 03:55:53,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 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:55:53,540 INFO L276 IsEmpty]: Start isEmpty. Operand 99791 states and 151879 transitions. [2024-10-11 03:55:53,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-10-11 03:55:53,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:55:53,594 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:53,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:55:53,594 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:55:53,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:55:53,595 INFO L85 PathProgramCache]: Analyzing trace with hash -433313016, now seen corresponding path program 1 times [2024-10-11 03:55:53,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:55:53,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824115111] [2024-10-11 03:55:53,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:55:53,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:55:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:55:53,734 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:55:53,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:55:53,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824115111] [2024-10-11 03:55:53,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824115111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:55:53,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:55:53,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:55:53,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272219276] [2024-10-11 03:55:53,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:55:53,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:55:53,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:55:53,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:55:53,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:55:53,737 INFO L87 Difference]: Start difference. First operand 99791 states and 151879 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 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:55:54,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:55:54,313 INFO L93 Difference]: Finished difference Result 200147 states and 304177 transitions. [2024-10-11 03:55:54,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:55:54,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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 258 [2024-10-11 03:55:54,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:55:54,514 INFO L225 Difference]: With dead ends: 200147 [2024-10-11 03:55:54,514 INFO L226 Difference]: Without dead ends: 140634 [2024-10-11 03:55:54,601 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:55:54,601 INFO L432 NwaCegarLoop]: 1779 mSDtfsCounter, 1024 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 2830 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:55:54,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1024 Valid, 2830 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:55:55,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140634 states. [2024-10-11 03:55:56,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140634 to 98093. [2024-10-11 03:55:56,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98093 states, 98091 states have (on average 1.519558369269352) internal successors, (149055), 98092 states have internal predecessors, (149055), 0 states have call successors, (0), 0 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:55:56,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98093 states to 98093 states and 149055 transitions. [2024-10-11 03:55:56,619 INFO L78 Accepts]: Start accepts. Automaton has 98093 states and 149055 transitions. Word has length 258 [2024-10-11 03:55:56,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:55:56,620 INFO L471 AbstractCegarLoop]: Abstraction has 98093 states and 149055 transitions. [2024-10-11 03:55:56,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 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:55:56,620 INFO L276 IsEmpty]: Start isEmpty. Operand 98093 states and 149055 transitions. [2024-10-11 03:55:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-10-11 03:55:56,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:55:56,677 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:56,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:55:56,677 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:55:56,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:55:56,678 INFO L85 PathProgramCache]: Analyzing trace with hash 634561687, now seen corresponding path program 1 times [2024-10-11 03:55:56,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:55:56,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914472367] [2024-10-11 03:55:56,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:55:56,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:55:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:55:56,834 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:55:56,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:55:56,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914472367] [2024-10-11 03:55:56,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914472367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:55:56,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:55:56,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:55:56,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610183307] [2024-10-11 03:55:56,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:55:56,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:55:56,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:55:56,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:55:56,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:55:56,837 INFO L87 Difference]: Start difference. First operand 98093 states and 149055 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 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:55:58,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:55:58,164 INFO L93 Difference]: Finished difference Result 225130 states and 348361 transitions. [2024-10-11 03:55:58,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:55:58,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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 258 [2024-10-11 03:55:58,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:55:58,415 INFO L225 Difference]: With dead ends: 225130 [2024-10-11 03:55:58,416 INFO L226 Difference]: Without dead ends: 149463 [2024-10-11 03:55:58,504 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:55:58,505 INFO L432 NwaCegarLoop]: 1414 mSDtfsCounter, 549 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 2249 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:55:58,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 2249 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:55:58,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149463 states. [2024-10-11 03:56:00,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149463 to 137961. [2024-10-11 03:56:01,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137961 states, 137959 states have (on average 1.5469016156974174) internal successors, (213409), 137960 states have internal predecessors, (213409), 0 states have call successors, (0), 0 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:56:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137961 states to 137961 states and 213409 transitions. [2024-10-11 03:56:01,512 INFO L78 Accepts]: Start accepts. Automaton has 137961 states and 213409 transitions. Word has length 258 [2024-10-11 03:56:01,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:56:01,513 INFO L471 AbstractCegarLoop]: Abstraction has 137961 states and 213409 transitions. [2024-10-11 03:56:01,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 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:56:01,513 INFO L276 IsEmpty]: Start isEmpty. Operand 137961 states and 213409 transitions. [2024-10-11 03:56:01,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-10-11 03:56:01,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:56:01,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:01,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:56:01,571 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:56:01,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:56:01,572 INFO L85 PathProgramCache]: Analyzing trace with hash -772514735, now seen corresponding path program 1 times [2024-10-11 03:56:01,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:56:01,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618523656] [2024-10-11 03:56:01,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:56:01,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:56:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:56:01,773 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:56:01,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:56:01,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618523656] [2024-10-11 03:56:01,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618523656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:56:01,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:56:01,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:56:01,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340982065] [2024-10-11 03:56:01,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:56:01,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:56:01,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:56:01,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:56:01,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:56:01,776 INFO L87 Difference]: Start difference. First operand 137961 states and 213409 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 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:56:03,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:56:03,680 INFO L93 Difference]: Finished difference Result 401070 states and 619926 transitions. [2024-10-11 03:56:03,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:56:03,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 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 259 [2024-10-11 03:56:03,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:56:04,117 INFO L225 Difference]: With dead ends: 401070 [2024-10-11 03:56:04,117 INFO L226 Difference]: Without dead ends: 269367 [2024-10-11 03:56:04,206 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:56:04,207 INFO L432 NwaCegarLoop]: 1993 mSDtfsCounter, 894 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 2995 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:56:04,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 2995 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:56:04,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269367 states. [2024-10-11 03:56:08,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269367 to 269353. [2024-10-11 03:56:08,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269353 states, 269351 states have (on average 1.5373397537042743) internal successors, (414084), 269352 states have internal predecessors, (414084), 0 states have call successors, (0), 0 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:56:09,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269353 states to 269353 states and 414084 transitions. [2024-10-11 03:56:09,007 INFO L78 Accepts]: Start accepts. Automaton has 269353 states and 414084 transitions. Word has length 259 [2024-10-11 03:56:09,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:56:09,007 INFO L471 AbstractCegarLoop]: Abstraction has 269353 states and 414084 transitions. [2024-10-11 03:56:09,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 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:56:09,008 INFO L276 IsEmpty]: Start isEmpty. Operand 269353 states and 414084 transitions. [2024-10-11 03:56:09,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-10-11 03:56:09,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:56:09,129 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:09,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:56:09,129 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:56:09,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:56:09,130 INFO L85 PathProgramCache]: Analyzing trace with hash 324869358, now seen corresponding path program 1 times [2024-10-11 03:56:09,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:56:09,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090407833] [2024-10-11 03:56:09,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:56:09,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:56:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:56:10,876 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:56:10,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:56:10,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090407833] [2024-10-11 03:56:10,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090407833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:56:10,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:56:10,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:56:10,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387743588] [2024-10-11 03:56:10,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:56:10,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:56:10,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:56:10,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:56:10,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:56:10,880 INFO L87 Difference]: Start difference. First operand 269353 states and 414084 transitions. Second operand has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 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:56:12,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:56:12,954 INFO L93 Difference]: Finished difference Result 529528 states and 813927 transitions. [2024-10-11 03:56:12,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:56:12,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 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 259 [2024-10-11 03:56:12,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:56:13,480 INFO L225 Difference]: With dead ends: 529528 [2024-10-11 03:56:13,481 INFO L226 Difference]: Without dead ends: 271385 [2024-10-11 03:56:13,681 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:56:13,681 INFO L432 NwaCegarLoop]: 1169 mSDtfsCounter, 92 mSDsluCounter, 2213 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 3382 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:56:13,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 3382 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:56:13,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271385 states. [2024-10-11 03:56:17,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271385 to 267433. [2024-10-11 03:56:17,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267433 states, 267431 states have (on average 1.5398813151803643) internal successors, (411812), 267432 states have internal predecessors, (411812), 0 states have call successors, (0), 0 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:56:18,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267433 states to 267433 states and 411812 transitions. [2024-10-11 03:56:18,486 INFO L78 Accepts]: Start accepts. Automaton has 267433 states and 411812 transitions. Word has length 259 [2024-10-11 03:56:18,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:56:18,486 INFO L471 AbstractCegarLoop]: Abstraction has 267433 states and 411812 transitions. [2024-10-11 03:56:18,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 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:56:18,486 INFO L276 IsEmpty]: Start isEmpty. Operand 267433 states and 411812 transitions. [2024-10-11 03:56:18,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-11 03:56:18,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:56:18,607 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:18,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:56:18,607 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:56:18,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:56:18,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1370673204, now seen corresponding path program 1 times [2024-10-11 03:56:18,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:56:18,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810836578] [2024-10-11 03:56:18,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:56:18,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:56:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:56:18,776 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:56:18,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:56:18,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810836578] [2024-10-11 03:56:18,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810836578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:56:18,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:56:18,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:56:18,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933576686] [2024-10-11 03:56:18,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:56:18,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:56:18,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:56:18,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:56:18,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:56:18,778 INFO L87 Difference]: Start difference. First operand 267433 states and 411812 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)