./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label06.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6b489d901bb99880d9ac9e7e788ba7286ba9b79b059b344dab5b39237cd3d6a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:55:21,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:55:21,956 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:55:21,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:55:21,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:55:22,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:55:22,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:55:22,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:55:22,019 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:55:22,019 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:55:22,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:55:22,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:55:22,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:55:22,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:55:22,025 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:55:22,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:55:22,025 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:55:22,026 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:55:22,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:55:22,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:55:22,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:55:22,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:55:22,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:55:22,028 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:55:22,029 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:55:22,030 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:55:22,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:55:22,031 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:55:22,031 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:55:22,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:55:22,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:55:22,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:55:22,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:55:22,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:55:22,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:55:22,033 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:55:22,034 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:55:22,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:55:22,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:55:22,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:55:22,035 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:55:22,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:55:22,036 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c6b489d901bb99880d9ac9e7e788ba7286ba9b79b059b344dab5b39237cd3d6a [2024-11-10 00:55:22,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:55:22,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:55:22,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:55:22,338 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:55:22,338 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:55:22,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label06.c [2024-11-10 00:55:23,785 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:55:24,248 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:55:24,249 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label06.c [2024-11-10 00:55:24,287 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dec09b64/8973ff0c22784e339c8570b88377ce13/FLAG76e3545d4 [2024-11-10 00:55:24,306 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dec09b64/8973ff0c22784e339c8570b88377ce13 [2024-11-10 00:55:24,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:55:24,311 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:55:24,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:55:24,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:55:24,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:55:24,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:55:24" (1/1) ... [2024-11-10 00:55:24,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@de49c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:24, skipping insertion in model container [2024-11-10 00:55:24,323 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:55:24" (1/1) ... [2024-11-10 00:55:24,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:55:24,871 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label06.c[11668,11681] [2024-11-10 00:55:24,906 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label06.c[14485,14498] [2024-11-10 00:55:25,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:55:25,729 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:55:25,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label06.c[11668,11681] [2024-11-10 00:55:25,770 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label06.c[14485,14498] [2024-11-10 00:55:26,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:55:26,157 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:55:26,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:26 WrapperNode [2024-11-10 00:55:26,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:55:26,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:55:26,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:55:26,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:55:26,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:26" (1/1) ... [2024-11-10 00:55:26,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:26" (1/1) ... [2024-11-10 00:55:26,538 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5095 [2024-11-10 00:55:26,539 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:55:26,540 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:55:26,540 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:55:26,540 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:55:26,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:26" (1/1) ... [2024-11-10 00:55:26,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:26" (1/1) ... [2024-11-10 00:55:26,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:26" (1/1) ... [2024-11-10 00:55:26,863 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 00:55:26,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:26" (1/1) ... [2024-11-10 00:55:26,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:26" (1/1) ... [2024-11-10 00:55:27,008 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:26" (1/1) ... [2024-11-10 00:55:27,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:26" (1/1) ... [2024-11-10 00:55:27,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:26" (1/1) ... [2024-11-10 00:55:27,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:26" (1/1) ... [2024-11-10 00:55:27,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:55:27,177 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:55:27,178 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:55:27,178 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:55:27,178 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:26" (1/1) ... [2024-11-10 00:55:27,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:55:27,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:55:27,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 00:55:27,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 00:55:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:55:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:55:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:55:27,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:55:27,357 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:55:27,358 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:55:32,719 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2129: havoc calculate_output_#t~ret37#1; [2024-11-10 00:55:32,720 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3608: havoc calculate_output2_#t~ret38#1; [2024-11-10 00:55:32,720 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5098: havoc calculate_output3_#t~ret39#1; [2024-11-10 00:55:33,037 INFO L? ?]: Removed 2081 outVars from TransFormulas that were not future-live. [2024-11-10 00:55:33,037 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:55:33,070 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:55:33,071 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:55:33,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:55:33 BoogieIcfgContainer [2024-11-10 00:55:33,072 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:55:33,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:55:33,078 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:55:33,081 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:55:33,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:55:24" (1/3) ... [2024-11-10 00:55:33,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d41254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:55:33, skipping insertion in model container [2024-11-10 00:55:33,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:26" (2/3) ... [2024-11-10 00:55:33,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d41254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:55:33, skipping insertion in model container [2024-11-10 00:55:33,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:55:33" (3/3) ... [2024-11-10 00:55:33,086 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label06.c [2024-11-10 00:55:33,103 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:55:33,104 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:55:33,201 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:55:33,209 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;@73ada9fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:55:33,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:55:33,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 908 states, 905 states have (on average 2.648618784530387) internal successors, (2397), 907 states have internal predecessors, (2397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:33,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 00:55:33,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:33,229 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] [2024-11-10 00:55:33,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:33,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:33,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1587648221, now seen corresponding path program 1 times [2024-11-10 00:55:33,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:33,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932201461] [2024-11-10 00:55:33,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:33,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:33,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:33,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932201461] [2024-11-10 00:55:33,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932201461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:33,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:33,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:55:33,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45003939] [2024-11-10 00:55:33,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:33,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:33,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:33,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:33,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:33,578 INFO L87 Difference]: Start difference. First operand has 908 states, 905 states have (on average 2.648618784530387) internal successors, (2397), 907 states have internal predecessors, (2397), 0 states have call successors, (0), 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 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:38,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:38,452 INFO L93 Difference]: Finished difference Result 2547 states and 6919 transitions. [2024-11-10 00:55:38,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:38,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-10 00:55:38,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:38,478 INFO L225 Difference]: With dead ends: 2547 [2024-11-10 00:55:38,479 INFO L226 Difference]: Without dead ends: 1592 [2024-11-10 00:55:38,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:38,487 INFO L432 NwaCegarLoop]: 659 mSDtfsCounter, 1618 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3697 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1618 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 4393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 3697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:38,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1618 Valid, 672 Invalid, 4393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 3697 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-10 00:55:38,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2024-11-10 00:55:38,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1592. [2024-11-10 00:55:38,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1590 states have (on average 2.466666666666667) internal successors, (3922), 1591 states have internal predecessors, (3922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 3922 transitions. [2024-11-10 00:55:38,605 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 3922 transitions. Word has length 26 [2024-11-10 00:55:38,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:38,606 INFO L471 AbstractCegarLoop]: Abstraction has 1592 states and 3922 transitions. [2024-11-10 00:55:38,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:38,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 3922 transitions. [2024-11-10 00:55:38,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 00:55:38,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:38,609 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] [2024-11-10 00:55:38,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:55:38,609 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:38,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:38,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1789896393, now seen corresponding path program 1 times [2024-11-10 00:55:38,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:38,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65912673] [2024-11-10 00:55:38,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:38,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:38,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:38,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:38,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65912673] [2024-11-10 00:55:38,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65912673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:38,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:38,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:55:38,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750627129] [2024-11-10 00:55:38,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:38,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:55:38,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:38,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:55:38,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:55:38,849 INFO L87 Difference]: Start difference. First operand 1592 states and 3922 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:38,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:38,944 INFO L93 Difference]: Finished difference Result 1643 states and 3999 transitions. [2024-11-10 00:55:38,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:55:38,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-10 00:55:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:38,953 INFO L225 Difference]: With dead ends: 1643 [2024-11-10 00:55:38,953 INFO L226 Difference]: Without dead ends: 1592 [2024-11-10 00:55:38,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:55:38,956 INFO L432 NwaCegarLoop]: 2260 mSDtfsCounter, 0 mSDsluCounter, 6744 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9004 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:38,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9004 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:38,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2024-11-10 00:55:38,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1592. [2024-11-10 00:55:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1590 states have (on average 2.4471698113207547) internal successors, (3891), 1591 states have internal predecessors, (3891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:39,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 3891 transitions. [2024-11-10 00:55:39,002 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 3891 transitions. Word has length 26 [2024-11-10 00:55:39,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:39,003 INFO L471 AbstractCegarLoop]: Abstraction has 1592 states and 3891 transitions. [2024-11-10 00:55:39,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:39,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 3891 transitions. [2024-11-10 00:55:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 00:55:39,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:39,005 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:39,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:55:39,006 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:39,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:39,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1922131449, now seen corresponding path program 1 times [2024-11-10 00:55:39,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:39,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295316551] [2024-11-10 00:55:39,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:39,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:39,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:39,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:39,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295316551] [2024-11-10 00:55:39,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295316551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:39,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:39,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:39,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360364556] [2024-11-10 00:55:39,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:39,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:39,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:39,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:39,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:39,248 INFO L87 Difference]: Start difference. First operand 1592 states and 3891 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:39,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:39,522 INFO L93 Difference]: Finished difference Result 2062 states and 4621 transitions. [2024-11-10 00:55:39,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 00:55:39,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-10 00:55:39,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:39,536 INFO L225 Difference]: With dead ends: 2062 [2024-11-10 00:55:39,536 INFO L226 Difference]: Without dead ends: 2015 [2024-11-10 00:55:39,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-10 00:55:39,539 INFO L432 NwaCegarLoop]: 2225 mSDtfsCounter, 11419 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11419 SdHoareTripleChecker+Valid, 3435 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:39,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11419 Valid, 3435 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:55:39,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2024-11-10 00:55:39,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1636. [2024-11-10 00:55:39,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1634 states have (on average 2.423500611995104) internal successors, (3960), 1635 states have internal predecessors, (3960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 3960 transitions. [2024-11-10 00:55:39,589 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 3960 transitions. Word has length 56 [2024-11-10 00:55:39,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:39,590 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 3960 transitions. [2024-11-10 00:55:39,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:39,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 3960 transitions. [2024-11-10 00:55:39,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:55:39,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:39,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] [2024-11-10 00:55:39,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:55:39,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:39,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:39,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1673221541, now seen corresponding path program 1 times [2024-11-10 00:55:39,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:39,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702807706] [2024-11-10 00:55:39,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:39,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:39,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:39,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702807706] [2024-11-10 00:55:39,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702807706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:39,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:39,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:39,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473145712] [2024-11-10 00:55:39,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:39,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:39,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:39,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:39,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:39,977 INFO L87 Difference]: Start difference. First operand 1636 states and 3960 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:40,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:40,186 INFO L93 Difference]: Finished difference Result 1730 states and 4104 transitions. [2024-11-10 00:55:40,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:55:40,187 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-10 00:55:40,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:40,195 INFO L225 Difference]: With dead ends: 1730 [2024-11-10 00:55:40,195 INFO L226 Difference]: Without dead ends: 1639 [2024-11-10 00:55:40,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:55:40,200 INFO L432 NwaCegarLoop]: 2224 mSDtfsCounter, 10884 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10884 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:40,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10884 Valid, 2501 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:55:40,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2024-11-10 00:55:40,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1636. [2024-11-10 00:55:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1634 states have (on average 2.422888616891065) internal successors, (3959), 1635 states have internal predecessors, (3959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:40,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 3959 transitions. [2024-11-10 00:55:40,240 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 3959 transitions. Word has length 58 [2024-11-10 00:55:40,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:40,242 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 3959 transitions. [2024-11-10 00:55:40,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:40,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 3959 transitions. [2024-11-10 00:55:40,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 00:55:40,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:40,247 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] [2024-11-10 00:55:40,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:55:40,248 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:40,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:40,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1393558986, now seen corresponding path program 1 times [2024-11-10 00:55:40,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:40,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815437551] [2024-11-10 00:55:40,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:40,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:40,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:40,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:40,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815437551] [2024-11-10 00:55:40,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815437551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:40,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:40,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:40,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547755595] [2024-11-10 00:55:40,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:40,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:40,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:40,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:40,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:40,371 INFO L87 Difference]: Start difference. First operand 1636 states and 3959 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:40,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:40,432 INFO L93 Difference]: Finished difference Result 1806 states and 4221 transitions. [2024-11-10 00:55:40,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:40,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-10 00:55:40,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:40,441 INFO L225 Difference]: With dead ends: 1806 [2024-11-10 00:55:40,441 INFO L226 Difference]: Without dead ends: 1715 [2024-11-10 00:55:40,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-11-10 00:55:40,443 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 2168 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2168 SdHoareTripleChecker+Valid, 2293 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:40,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2168 Valid, 2293 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:40,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2024-11-10 00:55:40,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1710. [2024-11-10 00:55:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1708 states have (on average 2.3834894613583137) internal successors, (4071), 1709 states have internal predecessors, (4071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:40,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 4071 transitions. [2024-11-10 00:55:40,487 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 4071 transitions. Word has length 59 [2024-11-10 00:55:40,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:40,487 INFO L471 AbstractCegarLoop]: Abstraction has 1710 states and 4071 transitions. [2024-11-10 00:55:40,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 4071 transitions. [2024-11-10 00:55:40,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:55:40,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:40,489 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] [2024-11-10 00:55:40,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:55:40,489 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:40,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:40,490 INFO L85 PathProgramCache]: Analyzing trace with hash 691569053, now seen corresponding path program 1 times [2024-11-10 00:55:40,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:40,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864089338] [2024-11-10 00:55:40,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:40,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:40,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:40,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:40,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864089338] [2024-11-10 00:55:40,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864089338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:40,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:40,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:40,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746571939] [2024-11-10 00:55:40,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:40,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:40,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:40,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:40,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:40,552 INFO L87 Difference]: Start difference. First operand 1710 states and 4071 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:40,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:40,590 INFO L93 Difference]: Finished difference Result 2024 states and 4549 transitions. [2024-11-10 00:55:40,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:40,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:55:40,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:40,599 INFO L225 Difference]: With dead ends: 2024 [2024-11-10 00:55:40,600 INFO L226 Difference]: Without dead ends: 1859 [2024-11-10 00:55:40,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-11-10 00:55:40,601 INFO L432 NwaCegarLoop]: 2280 mSDtfsCounter, 2181 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2181 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:40,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2181 Valid, 2358 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:40,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2024-11-10 00:55:40,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1856. [2024-11-10 00:55:40,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1854 states have (on average 2.313915857605178) internal successors, (4290), 1855 states have internal predecessors, (4290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 4290 transitions. [2024-11-10 00:55:40,644 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 4290 transitions. Word has length 60 [2024-11-10 00:55:40,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:40,644 INFO L471 AbstractCegarLoop]: Abstraction has 1856 states and 4290 transitions. [2024-11-10 00:55:40,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:40,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 4290 transitions. [2024-11-10 00:55:40,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:55:40,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:40,645 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] [2024-11-10 00:55:40,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:55:40,646 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:40,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:40,646 INFO L85 PathProgramCache]: Analyzing trace with hash -309840675, now seen corresponding path program 1 times [2024-11-10 00:55:40,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:40,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552697567] [2024-11-10 00:55:40,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:40,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:40,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:40,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552697567] [2024-11-10 00:55:40,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552697567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:40,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:40,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:40,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709145016] [2024-11-10 00:55:40,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:40,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:40,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:40,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:40,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:40,706 INFO L87 Difference]: Start difference. First operand 1856 states and 4290 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:40,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:40,751 INFO L93 Difference]: Finished difference Result 2446 states and 5178 transitions. [2024-11-10 00:55:40,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:40,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:55:40,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:40,762 INFO L225 Difference]: With dead ends: 2446 [2024-11-10 00:55:40,763 INFO L226 Difference]: Without dead ends: 2135 [2024-11-10 00:55:40,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:40,766 INFO L432 NwaCegarLoop]: 2278 mSDtfsCounter, 2179 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2179 SdHoareTripleChecker+Valid, 2360 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:40,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2179 Valid, 2360 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:40,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2024-11-10 00:55:40,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 2132. [2024-11-10 00:55:40,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2132 states, 2130 states have (on average 2.204694835680751) internal successors, (4696), 2131 states have internal predecessors, (4696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 4696 transitions. [2024-11-10 00:55:40,818 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 4696 transitions. Word has length 60 [2024-11-10 00:55:40,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:40,820 INFO L471 AbstractCegarLoop]: Abstraction has 2132 states and 4696 transitions. [2024-11-10 00:55:40,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:40,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 4696 transitions. [2024-11-10 00:55:40,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:55:40,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:40,821 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] [2024-11-10 00:55:40,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:55:40,822 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:40,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:40,822 INFO L85 PathProgramCache]: Analyzing trace with hash -324290531, now seen corresponding path program 1 times [2024-11-10 00:55:40,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:40,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040108851] [2024-11-10 00:55:40,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:40,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:40,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:40,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040108851] [2024-11-10 00:55:40,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040108851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:40,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:40,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:40,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710695012] [2024-11-10 00:55:40,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:40,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:40,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:40,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:40,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:40,896 INFO L87 Difference]: Start difference. First operand 2132 states and 4696 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:40,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:40,948 INFO L93 Difference]: Finished difference Result 3242 states and 6340 transitions. [2024-11-10 00:55:40,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:40,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:55:40,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:40,960 INFO L225 Difference]: With dead ends: 3242 [2024-11-10 00:55:40,960 INFO L226 Difference]: Without dead ends: 2655 [2024-11-10 00:55:40,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:40,963 INFO L432 NwaCegarLoop]: 2276 mSDtfsCounter, 2177 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2177 SdHoareTripleChecker+Valid, 2362 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:40,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2177 Valid, 2362 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:40,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2024-11-10 00:55:41,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 2652. [2024-11-10 00:55:41,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2652 states, 2650 states have (on average 2.0543396226415096) internal successors, (5444), 2651 states have internal predecessors, (5444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:41,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 5444 transitions. [2024-11-10 00:55:41,031 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 5444 transitions. Word has length 60 [2024-11-10 00:55:41,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:41,031 INFO L471 AbstractCegarLoop]: Abstraction has 2652 states and 5444 transitions. [2024-11-10 00:55:41,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:41,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 5444 transitions. [2024-11-10 00:55:41,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:55:41,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:41,032 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] [2024-11-10 00:55:41,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:55:41,033 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:41,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:41,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1767312221, now seen corresponding path program 1 times [2024-11-10 00:55:41,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:41,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566001028] [2024-11-10 00:55:41,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:41,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:41,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:41,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:41,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566001028] [2024-11-10 00:55:41,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566001028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:41,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:41,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:41,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393694031] [2024-11-10 00:55:41,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:41,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:41,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:41,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:41,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:41,092 INFO L87 Difference]: Start difference. First operand 2652 states and 5444 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:41,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:41,157 INFO L93 Difference]: Finished difference Result 4738 states and 8472 transitions. [2024-11-10 00:55:41,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:41,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:55:41,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:41,180 INFO L225 Difference]: With dead ends: 4738 [2024-11-10 00:55:41,181 INFO L226 Difference]: Without dead ends: 3631 [2024-11-10 00:55:41,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:41,189 INFO L432 NwaCegarLoop]: 2274 mSDtfsCounter, 2175 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2175 SdHoareTripleChecker+Valid, 2364 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:41,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2175 Valid, 2364 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:41,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3631 states. [2024-11-10 00:55:41,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3631 to 3628. [2024-11-10 00:55:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3628 states, 3626 states have (on average 1.87865416436845) internal successors, (6812), 3627 states have internal predecessors, (6812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:41,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 3628 states and 6812 transitions. [2024-11-10 00:55:41,288 INFO L78 Accepts]: Start accepts. Automaton has 3628 states and 6812 transitions. Word has length 60 [2024-11-10 00:55:41,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:41,289 INFO L471 AbstractCegarLoop]: Abstraction has 3628 states and 6812 transitions. [2024-11-10 00:55:41,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:41,289 INFO L276 IsEmpty]: Start isEmpty. Operand 3628 states and 6812 transitions. [2024-11-10 00:55:41,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:55:41,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:41,290 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] [2024-11-10 00:55:41,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:55:41,291 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:41,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:41,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1243035166, now seen corresponding path program 1 times [2024-11-10 00:55:41,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:41,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80225488] [2024-11-10 00:55:41,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:41,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:41,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:41,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:41,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80225488] [2024-11-10 00:55:41,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80225488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:41,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:41,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:55:41,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775942940] [2024-11-10 00:55:41,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:41,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:55:41,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:41,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:55:41,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:55:41,544 INFO L87 Difference]: Start difference. First operand 3628 states and 6812 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:41,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:41,621 INFO L93 Difference]: Finished difference Result 3727 states and 6942 transitions. [2024-11-10 00:55:41,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:55:41,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:55:41,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:41,632 INFO L225 Difference]: With dead ends: 3727 [2024-11-10 00:55:41,632 INFO L226 Difference]: Without dead ends: 3724 [2024-11-10 00:55:41,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:55:41,634 INFO L432 NwaCegarLoop]: 2228 mSDtfsCounter, 0 mSDsluCounter, 6675 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8903 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:41,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8903 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:41,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2024-11-10 00:55:41,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3724. [2024-11-10 00:55:41,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3724 states, 3722 states have (on average 1.8516926383664696) internal successors, (6892), 3723 states have internal predecessors, (6892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:41,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3724 states to 3724 states and 6892 transitions. [2024-11-10 00:55:41,727 INFO L78 Accepts]: Start accepts. Automaton has 3724 states and 6892 transitions. Word has length 60 [2024-11-10 00:55:41,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:41,728 INFO L471 AbstractCegarLoop]: Abstraction has 3724 states and 6892 transitions. [2024-11-10 00:55:41,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:41,728 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 6892 transitions. [2024-11-10 00:55:41,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 00:55:41,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:41,729 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] [2024-11-10 00:55:41,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:55:41,729 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:41,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:41,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1092605501, now seen corresponding path program 1 times [2024-11-10 00:55:41,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:41,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113089051] [2024-11-10 00:55:41,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:41,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:41,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:41,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:41,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113089051] [2024-11-10 00:55:41,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113089051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:41,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:41,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:41,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386865891] [2024-11-10 00:55:41,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:41,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:41,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:41,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:41,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:41,784 INFO L87 Difference]: Start difference. First operand 3724 states and 6892 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:41,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:41,859 INFO L93 Difference]: Finished difference Result 6038 states and 10197 transitions. [2024-11-10 00:55:41,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:41,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-10 00:55:41,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:41,880 INFO L225 Difference]: With dead ends: 6038 [2024-11-10 00:55:41,880 INFO L226 Difference]: Without dead ends: 4786 [2024-11-10 00:55:41,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:41,886 INFO L432 NwaCegarLoop]: 2285 mSDtfsCounter, 2180 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2180 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:41,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2180 Valid, 2359 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:41,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4786 states. [2024-11-10 00:55:42,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4786 to 4783. [2024-11-10 00:55:42,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4783 states, 4781 states have (on average 1.746705710102489) internal successors, (8351), 4782 states have internal predecessors, (8351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:42,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4783 states to 4783 states and 8351 transitions. [2024-11-10 00:55:42,032 INFO L78 Accepts]: Start accepts. Automaton has 4783 states and 8351 transitions. Word has length 62 [2024-11-10 00:55:42,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:42,033 INFO L471 AbstractCegarLoop]: Abstraction has 4783 states and 8351 transitions. [2024-11-10 00:55:42,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:42,034 INFO L276 IsEmpty]: Start isEmpty. Operand 4783 states and 8351 transitions. [2024-11-10 00:55:42,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:55:42,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:42,037 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:42,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:55:42,038 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:42,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:42,038 INFO L85 PathProgramCache]: Analyzing trace with hash 304318565, now seen corresponding path program 1 times [2024-11-10 00:55:42,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:42,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984649132] [2024-11-10 00:55:42,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:42,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:42,212 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:55:42,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:42,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984649132] [2024-11-10 00:55:42,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984649132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:42,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:42,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:42,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581502897] [2024-11-10 00:55:42,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:42,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:42,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:42,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:42,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:42,214 INFO L87 Difference]: Start difference. First operand 4783 states and 8351 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:42,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:42,784 INFO L93 Difference]: Finished difference Result 21665 states and 31947 transitions. [2024-11-10 00:55:42,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:55:42,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 81 [2024-11-10 00:55:42,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:42,830 INFO L225 Difference]: With dead ends: 21665 [2024-11-10 00:55:42,830 INFO L226 Difference]: Without dead ends: 18430 [2024-11-10 00:55:42,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:55:42,842 INFO L432 NwaCegarLoop]: 2303 mSDtfsCounter, 9075 mSDsluCounter, 2756 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9075 SdHoareTripleChecker+Valid, 5059 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:42,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9075 Valid, 5059 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:55:42,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18430 states. [2024-11-10 00:55:43,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18430 to 8015. [2024-11-10 00:55:43,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8015 states, 8013 states have (on average 1.6012729314863348) internal successors, (12831), 8014 states have internal predecessors, (12831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8015 states to 8015 states and 12831 transitions. [2024-11-10 00:55:43,250 INFO L78 Accepts]: Start accepts. Automaton has 8015 states and 12831 transitions. Word has length 81 [2024-11-10 00:55:43,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:43,251 INFO L471 AbstractCegarLoop]: Abstraction has 8015 states and 12831 transitions. [2024-11-10 00:55:43,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:43,251 INFO L276 IsEmpty]: Start isEmpty. Operand 8015 states and 12831 transitions. [2024-11-10 00:55:43,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:55:43,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:43,254 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:43,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:55:43,254 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:43,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:43,255 INFO L85 PathProgramCache]: Analyzing trace with hash -697091163, now seen corresponding path program 1 times [2024-11-10 00:55:43,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:43,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76242231] [2024-11-10 00:55:43,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:43,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:55:43,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:43,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76242231] [2024-11-10 00:55:43,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76242231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:43,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:43,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:43,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038961968] [2024-11-10 00:55:43,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:43,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:43,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:43,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:43,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:43,469 INFO L87 Difference]: Start difference. First operand 8015 states and 12831 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:44,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:44,003 INFO L93 Difference]: Finished difference Result 24897 states and 36427 transitions. [2024-11-10 00:55:44,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:55:44,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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 81 [2024-11-10 00:55:44,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:44,052 INFO L225 Difference]: With dead ends: 24897 [2024-11-10 00:55:44,053 INFO L226 Difference]: Without dead ends: 21662 [2024-11-10 00:55:44,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:55:44,070 INFO L432 NwaCegarLoop]: 2299 mSDtfsCounter, 9107 mSDsluCounter, 2651 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9107 SdHoareTripleChecker+Valid, 4950 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:44,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9107 Valid, 4950 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:55:44,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21662 states. [2024-11-10 00:55:44,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21662 to 12879. [2024-11-10 00:55:44,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12879 states, 12877 states have (on average 1.515803370350237) internal successors, (19519), 12878 states have internal predecessors, (19519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:44,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12879 states to 12879 states and 19519 transitions. [2024-11-10 00:55:44,681 INFO L78 Accepts]: Start accepts. Automaton has 12879 states and 19519 transitions. Word has length 81 [2024-11-10 00:55:44,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:44,682 INFO L471 AbstractCegarLoop]: Abstraction has 12879 states and 19519 transitions. [2024-11-10 00:55:44,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:44,682 INFO L276 IsEmpty]: Start isEmpty. Operand 12879 states and 19519 transitions. [2024-11-10 00:55:44,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:55:44,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:44,685 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:44,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:55:44,685 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:44,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:44,686 INFO L85 PathProgramCache]: Analyzing trace with hash -711541019, now seen corresponding path program 1 times [2024-11-10 00:55:44,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:44,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743723379] [2024-11-10 00:55:44,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:44,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:44,853 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 00:55:44,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:44,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743723379] [2024-11-10 00:55:44,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743723379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:44,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:44,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:44,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519221871] [2024-11-10 00:55:44,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:44,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:44,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:44,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:44,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:44,855 INFO L87 Difference]: Start difference. First operand 12879 states and 19519 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:45,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:45,398 INFO L93 Difference]: Finished difference Result 28129 states and 40907 transitions. [2024-11-10 00:55:45,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:55:45,399 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-10 00:55:45,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:45,456 INFO L225 Difference]: With dead ends: 28129 [2024-11-10 00:55:45,457 INFO L226 Difference]: Without dead ends: 24894 [2024-11-10 00:55:45,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:55:45,473 INFO L432 NwaCegarLoop]: 2295 mSDtfsCounter, 9145 mSDsluCounter, 2657 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9145 SdHoareTripleChecker+Valid, 4952 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:45,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9145 Valid, 4952 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:55:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24894 states. [2024-11-10 00:55:46,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24894 to 16111. [2024-11-10 00:55:46,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16111 states, 16109 states have (on average 1.4897883170898256) internal successors, (23999), 16110 states have internal predecessors, (23999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16111 states to 16111 states and 23999 transitions. [2024-11-10 00:55:46,069 INFO L78 Accepts]: Start accepts. Automaton has 16111 states and 23999 transitions. Word has length 81 [2024-11-10 00:55:46,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:46,070 INFO L471 AbstractCegarLoop]: Abstraction has 16111 states and 23999 transitions. [2024-11-10 00:55:46,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:46,070 INFO L276 IsEmpty]: Start isEmpty. Operand 16111 states and 23999 transitions. [2024-11-10 00:55:46,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:55:46,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:46,072 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:46,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:55:46,073 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:46,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:46,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1380061733, now seen corresponding path program 1 times [2024-11-10 00:55:46,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:46,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592700424] [2024-11-10 00:55:46,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:46,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:46,242 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 00:55:46,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:46,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592700424] [2024-11-10 00:55:46,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592700424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:46,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:46,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:46,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810473550] [2024-11-10 00:55:46,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:46,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:46,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:46,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:46,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:46,244 INFO L87 Difference]: Start difference. First operand 16111 states and 23999 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:46,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:46,787 INFO L93 Difference]: Finished difference Result 31361 states and 45387 transitions. [2024-11-10 00:55:46,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:55:46,788 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 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 81 [2024-11-10 00:55:46,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:46,848 INFO L225 Difference]: With dead ends: 31361 [2024-11-10 00:55:46,848 INFO L226 Difference]: Without dead ends: 28126 [2024-11-10 00:55:46,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:55:46,868 INFO L432 NwaCegarLoop]: 2301 mSDtfsCounter, 9095 mSDsluCounter, 2690 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9095 SdHoareTripleChecker+Valid, 4991 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:46,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9095 Valid, 4991 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:55:46,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28126 states. [2024-11-10 00:55:47,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28126 to 19343. [2024-11-10 00:55:47,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19343 states, 19341 states have (on average 1.4724678144873584) internal successors, (28479), 19342 states have internal predecessors, (28479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19343 states to 19343 states and 28479 transitions. [2024-11-10 00:55:47,483 INFO L78 Accepts]: Start accepts. Automaton has 19343 states and 28479 transitions. Word has length 81 [2024-11-10 00:55:47,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:47,483 INFO L471 AbstractCegarLoop]: Abstraction has 19343 states and 28479 transitions. [2024-11-10 00:55:47,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:47,484 INFO L276 IsEmpty]: Start isEmpty. Operand 19343 states and 28479 transitions. [2024-11-10 00:55:47,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:55:47,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:47,488 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:47,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:55:47,488 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:47,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:47,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1613241913, now seen corresponding path program 1 times [2024-11-10 00:55:47,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:47,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345457921] [2024-11-10 00:55:47,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:47,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:47,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:47,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345457921] [2024-11-10 00:55:47,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345457921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:47,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:47,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:47,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325920980] [2024-11-10 00:55:47,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:47,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:47,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:47,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:47,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:47,611 INFO L87 Difference]: Start difference. First operand 19343 states and 28479 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:47,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:47,904 INFO L93 Difference]: Finished difference Result 32043 states and 46282 transitions. [2024-11-10 00:55:47,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:47,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-10 00:55:47,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:47,936 INFO L225 Difference]: With dead ends: 32043 [2024-11-10 00:55:47,936 INFO L226 Difference]: Without dead ends: 14248 [2024-11-10 00:55:47,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:47,960 INFO L432 NwaCegarLoop]: 2273 mSDtfsCounter, 51 mSDsluCounter, 2216 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 4489 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:47,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 4489 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:47,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14248 states. [2024-11-10 00:55:48,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14248 to 14245. [2024-11-10 00:55:48,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14245 states, 14243 states have (on average 1.505651899178544) internal successors, (21445), 14244 states have internal predecessors, (21445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14245 states to 14245 states and 21445 transitions. [2024-11-10 00:55:48,474 INFO L78 Accepts]: Start accepts. Automaton has 14245 states and 21445 transitions. Word has length 83 [2024-11-10 00:55:48,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:48,474 INFO L471 AbstractCegarLoop]: Abstraction has 14245 states and 21445 transitions. [2024-11-10 00:55:48,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:48,475 INFO L276 IsEmpty]: Start isEmpty. Operand 14245 states and 21445 transitions. [2024-11-10 00:55:48,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:55:48,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:48,477 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:48,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:55:48,478 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:48,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:48,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1687926011, now seen corresponding path program 1 times [2024-11-10 00:55:48,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:48,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965273865] [2024-11-10 00:55:48,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:48,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:55:48,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:48,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965273865] [2024-11-10 00:55:48,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965273865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:48,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:48,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:48,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868335640] [2024-11-10 00:55:48,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:48,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:48,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:48,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:48,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:48,680 INFO L87 Difference]: Start difference. First operand 14245 states and 21445 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:49,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:49,366 INFO L93 Difference]: Finished difference Result 25783 states and 37617 transitions. [2024-11-10 00:55:49,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:55:49,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-10 00:55:49,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:49,416 INFO L225 Difference]: With dead ends: 25783 [2024-11-10 00:55:49,417 INFO L226 Difference]: Without dead ends: 23476 [2024-11-10 00:55:49,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:55:49,432 INFO L432 NwaCegarLoop]: 2293 mSDtfsCounter, 9095 mSDsluCounter, 2835 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9095 SdHoareTripleChecker+Valid, 5128 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:49,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9095 Valid, 5128 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:55:49,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23476 states. [2024-11-10 00:55:50,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23476 to 16549. [2024-11-10 00:55:50,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16549 states, 16547 states have (on average 1.4893938478274007) internal successors, (24645), 16548 states have internal predecessors, (24645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:50,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16549 states to 16549 states and 24645 transitions. [2024-11-10 00:55:50,165 INFO L78 Accepts]: Start accepts. Automaton has 16549 states and 24645 transitions. Word has length 83 [2024-11-10 00:55:50,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:50,166 INFO L471 AbstractCegarLoop]: Abstraction has 16549 states and 24645 transitions. [2024-11-10 00:55:50,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:50,166 INFO L276 IsEmpty]: Start isEmpty. Operand 16549 states and 24645 transitions. [2024-11-10 00:55:50,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 00:55:50,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:50,170 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:50,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:55:50,170 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:50,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:50,171 INFO L85 PathProgramCache]: Analyzing trace with hash -604865433, now seen corresponding path program 1 times [2024-11-10 00:55:50,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:50,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321359171] [2024-11-10 00:55:50,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:50,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:50,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:50,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321359171] [2024-11-10 00:55:50,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321359171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:50,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:50,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:50,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244180410] [2024-11-10 00:55:50,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:50,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:50,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:50,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:50,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:50,312 INFO L87 Difference]: Start difference. First operand 16549 states and 24645 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:50,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:50,549 INFO L93 Difference]: Finished difference Result 24043 states and 35049 transitions. [2024-11-10 00:55:50,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:50,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-10 00:55:50,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:50,569 INFO L225 Difference]: With dead ends: 24043 [2024-11-10 00:55:50,570 INFO L226 Difference]: Without dead ends: 9064 [2024-11-10 00:55:50,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:50,587 INFO L432 NwaCegarLoop]: 2266 mSDtfsCounter, 44 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4474 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:50,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4474 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:50,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9064 states. [2024-11-10 00:55:50,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9064 to 9061. [2024-11-10 00:55:50,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9061 states, 9059 states have (on average 1.5609890716414616) internal successors, (14141), 9060 states have internal predecessors, (14141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:50,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9061 states to 9061 states and 14141 transitions. [2024-11-10 00:55:50,809 INFO L78 Accepts]: Start accepts. Automaton has 9061 states and 14141 transitions. Word has length 85 [2024-11-10 00:55:50,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:50,810 INFO L471 AbstractCegarLoop]: Abstraction has 9061 states and 14141 transitions. [2024-11-10 00:55:50,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:50,810 INFO L276 IsEmpty]: Start isEmpty. Operand 9061 states and 14141 transitions. [2024-11-10 00:55:50,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 00:55:50,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:50,812 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:50,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:55:50,813 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:50,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:50,813 INFO L85 PathProgramCache]: Analyzing trace with hash 884605097, now seen corresponding path program 1 times [2024-11-10 00:55:50,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:50,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21456736] [2024-11-10 00:55:50,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:50,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:50,909 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:50,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:50,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21456736] [2024-11-10 00:55:50,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21456736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:50,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:50,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:50,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332794066] [2024-11-10 00:55:50,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:50,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:50,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:50,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:50,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:50,912 INFO L87 Difference]: Start difference. First operand 9061 states and 14141 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:51,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:51,064 INFO L93 Difference]: Finished difference Result 12811 states and 19293 transitions. [2024-11-10 00:55:51,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:51,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-10 00:55:51,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:51,074 INFO L225 Difference]: With dead ends: 12811 [2024-11-10 00:55:51,074 INFO L226 Difference]: Without dead ends: 5320 [2024-11-10 00:55:51,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:51,081 INFO L432 NwaCegarLoop]: 2259 mSDtfsCounter, 39 mSDsluCounter, 2200 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 4459 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:51,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 4459 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:51,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5320 states. [2024-11-10 00:55:51,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5320 to 5317. [2024-11-10 00:55:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5317 states, 5315 states have (on average 1.682220131702728) internal successors, (8941), 5316 states have internal predecessors, (8941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:51,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5317 states to 5317 states and 8941 transitions. [2024-11-10 00:55:51,193 INFO L78 Accepts]: Start accepts. Automaton has 5317 states and 8941 transitions. Word has length 87 [2024-11-10 00:55:51,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:51,193 INFO L471 AbstractCegarLoop]: Abstraction has 5317 states and 8941 transitions. [2024-11-10 00:55:51,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:51,193 INFO L276 IsEmpty]: Start isEmpty. Operand 5317 states and 8941 transitions. [2024-11-10 00:55:51,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 00:55:51,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:51,195 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:51,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:55:51,196 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:51,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:51,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2145385200, now seen corresponding path program 1 times [2024-11-10 00:55:51,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:51,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315152753] [2024-11-10 00:55:51,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:51,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:51,285 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:51,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:51,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315152753] [2024-11-10 00:55:51,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315152753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:51,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:51,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:51,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052411615] [2024-11-10 00:55:51,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:51,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:51,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:51,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:51,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:51,288 INFO L87 Difference]: Start difference. First operand 5317 states and 8941 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:51,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:51,349 INFO L93 Difference]: Finished difference Result 7195 states and 11493 transitions. [2024-11-10 00:55:51,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:51,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-11-10 00:55:51,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:51,358 INFO L225 Difference]: With dead ends: 7195 [2024-11-10 00:55:51,358 INFO L226 Difference]: Without dead ends: 3448 [2024-11-10 00:55:51,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:51,362 INFO L432 NwaCegarLoop]: 2252 mSDtfsCounter, 36 mSDsluCounter, 2192 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 4444 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:51,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 4444 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:51,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3448 states. [2024-11-10 00:55:51,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3448 to 3445. [2024-11-10 00:55:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3445 states, 3443 states have (on average 1.8492593668312518) internal successors, (6367), 3444 states have internal predecessors, (6367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 3445 states and 6367 transitions. [2024-11-10 00:55:51,426 INFO L78 Accepts]: Start accepts. Automaton has 3445 states and 6367 transitions. Word has length 89 [2024-11-10 00:55:51,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:51,427 INFO L471 AbstractCegarLoop]: Abstraction has 3445 states and 6367 transitions. [2024-11-10 00:55:51,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:51,427 INFO L276 IsEmpty]: Start isEmpty. Operand 3445 states and 6367 transitions. [2024-11-10 00:55:51,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 00:55:51,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:51,428 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:51,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:55:51,429 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:51,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:51,429 INFO L85 PathProgramCache]: Analyzing trace with hash 2015095447, now seen corresponding path program 1 times [2024-11-10 00:55:51,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:51,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464497087] [2024-11-10 00:55:51,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:51,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:51,510 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:51,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:51,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464497087] [2024-11-10 00:55:51,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464497087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:51,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:51,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:51,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764251408] [2024-11-10 00:55:51,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:51,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:51,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:51,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:51,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:51,511 INFO L87 Difference]: Start difference. First operand 3445 states and 6367 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:51,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:51,554 INFO L93 Difference]: Finished difference Result 4387 states and 7632 transitions. [2024-11-10 00:55:51,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:51,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-11-10 00:55:51,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:51,561 INFO L225 Difference]: With dead ends: 4387 [2024-11-10 00:55:51,562 INFO L226 Difference]: Without dead ends: 2512 [2024-11-10 00:55:51,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:51,564 INFO L432 NwaCegarLoop]: 2245 mSDtfsCounter, 33 mSDsluCounter, 2184 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4429 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:51,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4429 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:51,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2024-11-10 00:55:51,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 2509. [2024-11-10 00:55:51,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2509 states, 2507 states have (on average 2.031511767052254) internal successors, (5093), 2508 states have internal predecessors, (5093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:51,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 5093 transitions. [2024-11-10 00:55:51,610 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 5093 transitions. Word has length 91 [2024-11-10 00:55:51,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:51,610 INFO L471 AbstractCegarLoop]: Abstraction has 2509 states and 5093 transitions. [2024-11-10 00:55:51,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:51,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 5093 transitions. [2024-11-10 00:55:51,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 00:55:51,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:51,612 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:51,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:55:51,612 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:51,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:51,612 INFO L85 PathProgramCache]: Analyzing trace with hash -196861634, now seen corresponding path program 1 times [2024-11-10 00:55:51,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:51,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820076325] [2024-11-10 00:55:51,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:51,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:51,965 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:51,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:51,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820076325] [2024-11-10 00:55:51,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820076325] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:55:51,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860078] [2024-11-10 00:55:51,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:51,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:55:51,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:55:51,969 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:55:51,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 00:55:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:52,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 00:55:52,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:55:53,518 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:53,518 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:55:55,262 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:55,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860078] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:55:55,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:55:55,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 30 [2024-11-10 00:55:55,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334966509] [2024-11-10 00:55:55,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:55:55,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 00:55:55,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:55,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 00:55:55,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2024-11-10 00:55:55,265 INFO L87 Difference]: Start difference. First operand 2509 states and 5093 transitions. Second operand has 30 states, 30 states have (on average 8.033333333333333) internal successors, (241), 30 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:56,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:56,542 INFO L93 Difference]: Finished difference Result 5465 states and 9031 transitions. [2024-11-10 00:55:56,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-10 00:55:56,543 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.033333333333333) internal successors, (241), 30 states have internal predecessors, (241), 0 states have call successors, (0), 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 93 [2024-11-10 00:55:56,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:56,552 INFO L225 Difference]: With dead ends: 5465 [2024-11-10 00:55:56,552 INFO L226 Difference]: Without dead ends: 4526 [2024-11-10 00:55:56,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=714, Invalid=2366, Unknown=0, NotChecked=0, Total=3080 [2024-11-10 00:55:56,556 INFO L432 NwaCegarLoop]: 2200 mSDtfsCounter, 9886 mSDsluCounter, 13618 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9886 SdHoareTripleChecker+Valid, 15818 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:56,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9886 Valid, 15818 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 00:55:56,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4526 states. [2024-11-10 00:55:56,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4526 to 4433. [2024-11-10 00:55:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4433 states, 4431 states have (on average 1.71857368539833) internal successors, (7615), 4432 states have internal predecessors, (7615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:56,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4433 states to 4433 states and 7615 transitions. [2024-11-10 00:55:56,660 INFO L78 Accepts]: Start accepts. Automaton has 4433 states and 7615 transitions. Word has length 93 [2024-11-10 00:55:56,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:56,661 INFO L471 AbstractCegarLoop]: Abstraction has 4433 states and 7615 transitions. [2024-11-10 00:55:56,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.033333333333333) internal successors, (241), 30 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:56,661 INFO L276 IsEmpty]: Start isEmpty. Operand 4433 states and 7615 transitions. [2024-11-10 00:55:56,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 00:55:56,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:56,663 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:56,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 00:55:56,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-10 00:55:56,864 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:56,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:56,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1939014882, now seen corresponding path program 1 times [2024-11-10 00:55:56,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:56,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815640369] [2024-11-10 00:55:56,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:56,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:57,724 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:57,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:57,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815640369] [2024-11-10 00:55:57,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815640369] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:55:57,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530725598] [2024-11-10 00:55:57,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:57,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:55:57,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:55:57,727 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:55:57,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 00:55:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:57,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 00:55:57,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:55:58,548 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:58,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:55:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:59,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530725598] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:55:59,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:55:59,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2024-11-10 00:55:59,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453785823] [2024-11-10 00:55:59,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:55:59,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-10 00:55:59,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:59,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-10 00:55:59,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1030, Unknown=0, NotChecked=0, Total=1190 [2024-11-10 00:55:59,521 INFO L87 Difference]: Start difference. First operand 4433 states and 7615 transitions. Second operand has 35 states, 35 states have (on average 7.114285714285714) internal successors, (249), 35 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-11-10 00:56:01,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:01,720 INFO L93 Difference]: Finished difference Result 18315 states and 25922 transitions. [2024-11-10 00:56:01,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-10 00:56:01,721 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 7.114285714285714) internal successors, (249), 35 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 93 [2024-11-10 00:56:01,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:01,747 INFO L225 Difference]: With dead ends: 18315 [2024-11-10 00:56:01,747 INFO L226 Difference]: Without dead ends: 15452 [2024-11-10 00:56:01,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=972, Invalid=4430, Unknown=0, NotChecked=0, Total=5402 [2024-11-10 00:56:01,757 INFO L432 NwaCegarLoop]: 2194 mSDtfsCounter, 27296 mSDsluCounter, 13747 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27296 SdHoareTripleChecker+Valid, 15941 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:01,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27296 Valid, 15941 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:56:01,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15452 states. [2024-11-10 00:56:02,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15452 to 14105. [2024-11-10 00:56:02,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14105 states, 14103 states have (on average 1.428561299014394) internal successors, (20147), 14104 states have internal predecessors, (20147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:02,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14105 states to 14105 states and 20147 transitions. [2024-11-10 00:56:02,208 INFO L78 Accepts]: Start accepts. Automaton has 14105 states and 20147 transitions. Word has length 93 [2024-11-10 00:56:02,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:02,208 INFO L471 AbstractCegarLoop]: Abstraction has 14105 states and 20147 transitions. [2024-11-10 00:56:02,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.114285714285714) internal successors, (249), 35 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-11-10 00:56:02,209 INFO L276 IsEmpty]: Start isEmpty. Operand 14105 states and 20147 transitions. [2024-11-10 00:56:02,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 00:56:02,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:02,213 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:56:02,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 00:56:02,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-10 00:56:02,414 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:02,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:02,415 INFO L85 PathProgramCache]: Analyzing trace with hash -666702594, now seen corresponding path program 1 times [2024-11-10 00:56:02,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:02,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080276916] [2024-11-10 00:56:02,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:02,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:03,357 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:03,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:03,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080276916] [2024-11-10 00:56:03,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080276916] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:56:03,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570306756] [2024-11-10 00:56:03,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:03,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:56:03,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:56:03,359 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:56:03,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 00:56:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:03,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:56:03,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:56:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:03,855 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:56:04,643 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:04,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570306756] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:56:04,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:56:04,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2024-11-10 00:56:04,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023891897] [2024-11-10 00:56:04,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:56:04,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-10 00:56:04,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:04,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-10 00:56:04,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2024-11-10 00:56:04,645 INFO L87 Difference]: Start difference. First operand 14105 states and 20147 transitions. Second operand has 29 states, 29 states have (on average 8.241379310344827) internal successors, (239), 28 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:07,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:07,201 INFO L93 Difference]: Finished difference Result 71170 states and 94573 transitions. [2024-11-10 00:56:07,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-10 00:56:07,201 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.241379310344827) internal successors, (239), 28 states have internal predecessors, (239), 0 states have call successors, (0), 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 93 [2024-11-10 00:56:07,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:07,293 INFO L225 Difference]: With dead ends: 71170 [2024-11-10 00:56:07,293 INFO L226 Difference]: Without dead ends: 58635 [2024-11-10 00:56:07,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=710, Invalid=2830, Unknown=0, NotChecked=0, Total=3540 [2024-11-10 00:56:07,324 INFO L432 NwaCegarLoop]: 2204 mSDtfsCounter, 29317 mSDsluCounter, 9564 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29317 SdHoareTripleChecker+Valid, 11768 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:07,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29317 Valid, 11768 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:56:07,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58635 states. [2024-11-10 00:56:08,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58635 to 55575. [2024-11-10 00:56:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55575 states, 55573 states have (on average 1.321864934410595) internal successors, (73460), 55574 states have internal predecessors, (73460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55575 states to 55575 states and 73460 transitions. [2024-11-10 00:56:08,777 INFO L78 Accepts]: Start accepts. Automaton has 55575 states and 73460 transitions. Word has length 93 [2024-11-10 00:56:08,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:08,778 INFO L471 AbstractCegarLoop]: Abstraction has 55575 states and 73460 transitions. [2024-11-10 00:56:08,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.241379310344827) internal successors, (239), 28 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 55575 states and 73460 transitions. [2024-11-10 00:56:08,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:56:08,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:08,784 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:56:08,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 00:56:08,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:56:08,985 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:08,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:08,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1841642136, now seen corresponding path program 1 times [2024-11-10 00:56:08,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:08,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185615933] [2024-11-10 00:56:08,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:08,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:09,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:09,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185615933] [2024-11-10 00:56:09,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185615933] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:56:09,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444571175] [2024-11-10 00:56:09,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:09,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:56:09,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:56:09,537 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:56:09,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 00:56:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:09,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 00:56:09,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:56:11,448 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:11,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:56:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:12,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444571175] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:56:12,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:56:12,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 36 [2024-11-10 00:56:12,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836167319] [2024-11-10 00:56:12,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:56:12,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-10 00:56:12,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:12,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-10 00:56:12,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1138, Unknown=0, NotChecked=0, Total=1260 [2024-11-10 00:56:12,569 INFO L87 Difference]: Start difference. First operand 55575 states and 73460 transitions. Second operand has 36 states, 36 states have (on average 6.833333333333333) internal successors, (246), 36 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-11-10 00:56:25,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:25,121 INFO L93 Difference]: Finished difference Result 213863 states and 278402 transitions. [2024-11-10 00:56:25,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2024-11-10 00:56:25,121 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 6.833333333333333) internal successors, (246), 36 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 94 [2024-11-10 00:56:25,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:25,331 INFO L225 Difference]: With dead ends: 213863 [2024-11-10 00:56:25,332 INFO L226 Difference]: Without dead ends: 159858 [2024-11-10 00:56:25,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13029 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=4610, Invalid=30172, Unknown=0, NotChecked=0, Total=34782 [2024-11-10 00:56:25,396 INFO L432 NwaCegarLoop]: 2340 mSDtfsCounter, 31685 mSDsluCounter, 26562 mSDsCounter, 0 mSdLazyCounter, 2998 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31685 SdHoareTripleChecker+Valid, 28902 SdHoareTripleChecker+Invalid, 3074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:25,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31685 Valid, 28902 Invalid, 3074 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [76 Valid, 2998 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 00:56:25,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159858 states. [2024-11-10 00:56:27,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159858 to 54173. [2024-11-10 00:56:28,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54173 states, 54171 states have (on average 1.3140425689021802) internal successors, (71183), 54172 states have internal predecessors, (71183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54173 states to 54173 states and 71183 transitions. [2024-11-10 00:56:28,117 INFO L78 Accepts]: Start accepts. Automaton has 54173 states and 71183 transitions. Word has length 94 [2024-11-10 00:56:28,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:28,118 INFO L471 AbstractCegarLoop]: Abstraction has 54173 states and 71183 transitions. [2024-11-10 00:56:28,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 6.833333333333333) internal successors, (246), 36 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-11-10 00:56:28,118 INFO L276 IsEmpty]: Start isEmpty. Operand 54173 states and 71183 transitions. [2024-11-10 00:56:28,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 00:56:28,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:28,124 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:56:28,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 00:56:28,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:56:28,325 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:28,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:28,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1584207257, now seen corresponding path program 1 times [2024-11-10 00:56:28,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:28,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877698897] [2024-11-10 00:56:28,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:28,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:28,878 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:28,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:28,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877698897] [2024-11-10 00:56:28,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877698897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:56:28,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426165396] [2024-11-10 00:56:28,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:28,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:56:28,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:56:28,881 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:56:28,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 00:56:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:29,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 00:56:29,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:56:31,475 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:31,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:56:33,356 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:33,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426165396] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:56:33,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:56:33,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 21, 18] total 45 [2024-11-10 00:56:33,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299168364] [2024-11-10 00:56:33,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:56:33,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-10 00:56:33,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:33,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-10 00:56:33,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1796, Unknown=0, NotChecked=0, Total=1980 [2024-11-10 00:56:33,359 INFO L87 Difference]: Start difference. First operand 54173 states and 71183 transitions. Second operand has 45 states, 45 states have (on average 5.711111111111111) internal successors, (257), 45 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)