./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label02.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.1.ufo.UNBOUNDED.pals+Problem12_label02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f64db8798478892c7952ed2e39de053718a88a4933b23364a7fdbf37373a3455 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:53:35,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:53:35,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:53:35,251 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:53:35,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:53:35,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:53:35,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:53:35,286 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:53:35,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:53:35,288 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:53:35,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:53:35,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:53:35,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:53:35,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:53:35,292 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:53:35,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:53:35,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:53:35,293 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:53:35,293 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:53:35,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:53:35,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:53:35,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:53:35,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:53:35,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:53:35,298 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:53:35,298 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:53:35,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:53:35,299 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:53:35,307 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:53:35,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:53:35,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:53:35,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:53:35,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:53:35,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:53:35,308 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:53:35,308 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:53:35,308 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:53:35,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:53:35,309 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:53:35,309 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:53:35,309 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:53:35,311 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:53:35,311 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f64db8798478892c7952ed2e39de053718a88a4933b23364a7fdbf37373a3455 [2024-11-10 00:53:35,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:53:35,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:53:35,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:53:35,566 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:53:35,567 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:53:35,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-10 00:53:36,892 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:53:37,243 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:53:37,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-10 00:53:37,269 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388de56b3/5b57c71647244588b2a3aae4a8fd576c/FLAG1e6034d20 [2024-11-10 00:53:37,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388de56b3/5b57c71647244588b2a3aae4a8fd576c [2024-11-10 00:53:37,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:53:37,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:53:37,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:53:37,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:53:37,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:53:37,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:53:37" (1/1) ... [2024-11-10 00:53:37,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391238e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:37, skipping insertion in model container [2024-11-10 00:53:37,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:53:37" (1/1) ... [2024-11-10 00:53:37,373 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:53:37,686 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.1.ufo.UNBOUNDED.pals+Problem12_label02.c[11705,11718] [2024-11-10 00:53:37,745 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.1.ufo.UNBOUNDED.pals+Problem12_label02.c[18995,19008] [2024-11-10 00:53:38,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:53:38,367 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:53:38,399 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.1.ufo.UNBOUNDED.pals+Problem12_label02.c[11705,11718] [2024-11-10 00:53:38,408 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.1.ufo.UNBOUNDED.pals+Problem12_label02.c[18995,19008] [2024-11-10 00:53:38,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:53:38,787 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:53:38,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:38 WrapperNode [2024-11-10 00:53:38,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:53:38,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:53:38,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:53:38,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:53:38,811 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:53:38" (1/1) ... [2024-11-10 00:53:38,876 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:53:38" (1/1) ... [2024-11-10 00:53:39,060 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5096 [2024-11-10 00:53:39,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:53:39,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:53:39,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:53:39,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:53:39,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:38" (1/1) ... [2024-11-10 00:53:39,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:38" (1/1) ... [2024-11-10 00:53:39,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:38" (1/1) ... [2024-11-10 00:53:39,288 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:53:39,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:38" (1/1) ... [2024-11-10 00:53:39,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:38" (1/1) ... [2024-11-10 00:53:39,405 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:38" (1/1) ... [2024-11-10 00:53:39,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:38" (1/1) ... [2024-11-10 00:53:39,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:38" (1/1) ... [2024-11-10 00:53:39,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:38" (1/1) ... [2024-11-10 00:53:39,548 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:53:39,549 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:53:39,550 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:53:39,550 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:53:39,551 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:38" (1/1) ... [2024-11-10 00:53:39,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:53:39,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:53:39,581 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:53:39,584 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:53:39,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:53:39,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:53:39,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:53:39,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:53:39,723 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:53:39,725 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:53:43,966 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2131: havoc calculate_output_#t~ret37#1; [2024-11-10 00:53:43,967 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3610: havoc calculate_output2_#t~ret38#1; [2024-11-10 00:53:43,967 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5100: havoc calculate_output3_#t~ret39#1; [2024-11-10 00:53:44,164 INFO L? ?]: Removed 2081 outVars from TransFormulas that were not future-live. [2024-11-10 00:53:44,165 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:53:44,203 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:53:44,203 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:53:44,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:53:44 BoogieIcfgContainer [2024-11-10 00:53:44,205 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:53:44,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:53:44,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:53:44,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:53:44,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:53:37" (1/3) ... [2024-11-10 00:53:44,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7690ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:53:44, skipping insertion in model container [2024-11-10 00:53:44,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:38" (2/3) ... [2024-11-10 00:53:44,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7690ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:53:44, skipping insertion in model container [2024-11-10 00:53:44,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:53:44" (3/3) ... [2024-11-10 00:53:44,214 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-10 00:53:44,230 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:53:44,230 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:53:44,310 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:53:44,316 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;@275721c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:53:44,316 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:53:44,324 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:53:44,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 00:53:44,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:44,331 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:53:44,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:44,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:44,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1381072168, now seen corresponding path program 1 times [2024-11-10 00:53:44,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:44,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478571048] [2024-11-10 00:53:44,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:44,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:44,569 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:53:44,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:44,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478571048] [2024-11-10 00:53:44,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478571048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:44,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:44,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:53:44,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353723908] [2024-11-10 00:53:44,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:44,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:53:44,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:44,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:53:44,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:53:44,599 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 2 states, 2 states have (on average 13.0) 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:53:44,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:44,668 INFO L93 Difference]: Finished difference Result 1775 states and 4720 transitions. [2024-11-10 00:53:44,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:53:44,670 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) 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:53:44,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:44,688 INFO L225 Difference]: With dead ends: 1775 [2024-11-10 00:53:44,688 INFO L226 Difference]: Without dead ends: 840 [2024-11-10 00:53:44,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:53:44,698 INFO L432 NwaCegarLoop]: 2326 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2326 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:53:44,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2326 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:53:44,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-11-10 00:53:44,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 840. [2024-11-10 00:53:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 838 states have (on average 2.6992840095465396) internal successors, (2262), 839 states have internal predecessors, (2262), 0 states have call successors, (0), 0 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:53:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 2262 transitions. [2024-11-10 00:53:44,764 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 2262 transitions. Word has length 26 [2024-11-10 00:53:44,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:44,764 INFO L471 AbstractCegarLoop]: Abstraction has 840 states and 2262 transitions. [2024-11-10 00:53:44,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) 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:53:44,769 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 2262 transitions. [2024-11-10 00:53:44,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 00:53:44,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:44,770 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:53:44,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:53:44,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:44,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:44,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1789896393, now seen corresponding path program 1 times [2024-11-10 00:53:44,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:44,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063683059] [2024-11-10 00:53:44,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:44,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:45,010 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:53:45,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:45,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063683059] [2024-11-10 00:53:45,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063683059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:45,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:45,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:53:45,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181336768] [2024-11-10 00:53:45,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:45,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:53:45,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:45,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:53:45,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:53:45,015 INFO L87 Difference]: Start difference. First operand 840 states and 2262 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:53:45,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:45,128 INFO L93 Difference]: Finished difference Result 891 states and 2339 transitions. [2024-11-10 00:53:45,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:53:45,128 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:53:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:45,132 INFO L225 Difference]: With dead ends: 891 [2024-11-10 00:53:45,132 INFO L226 Difference]: Without dead ends: 840 [2024-11-10 00:53:45,133 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:53:45,134 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.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:53:45,134 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.1s Time] [2024-11-10 00:53:45,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-11-10 00:53:45,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 840. [2024-11-10 00:53:45,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 838 states have (on average 2.662291169451074) internal successors, (2231), 839 states have internal predecessors, (2231), 0 states have call successors, (0), 0 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:53:45,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 2231 transitions. [2024-11-10 00:53:45,164 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 2231 transitions. Word has length 26 [2024-11-10 00:53:45,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:45,165 INFO L471 AbstractCegarLoop]: Abstraction has 840 states and 2231 transitions. [2024-11-10 00:53:45,165 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:53:45,165 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 2231 transitions. [2024-11-10 00:53:45,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 00:53:45,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:45,167 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:53:45,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:53:45,167 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:45,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:45,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1922131449, now seen corresponding path program 1 times [2024-11-10 00:53:45,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:45,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155146331] [2024-11-10 00:53:45,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:45,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:45,350 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:53:45,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:45,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155146331] [2024-11-10 00:53:45,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155146331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:45,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:45,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:53:45,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873671545] [2024-11-10 00:53:45,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:45,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:53:45,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:45,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:53:45,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:53:45,354 INFO L87 Difference]: Start difference. First operand 840 states and 2231 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:53:45,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:45,581 INFO L93 Difference]: Finished difference Result 1310 states and 2961 transitions. [2024-11-10 00:53:45,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 00:53:45,581 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:53:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:45,586 INFO L225 Difference]: With dead ends: 1310 [2024-11-10 00:53:45,586 INFO L226 Difference]: Without dead ends: 1263 [2024-11-10 00:53:45,587 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:53:45,588 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:53:45,588 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:53:45,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2024-11-10 00:53:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 884. [2024-11-10 00:53:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 882 states have (on average 2.6077097505668934) internal successors, (2300), 883 states have internal predecessors, (2300), 0 states have call successors, (0), 0 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:53:45,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 2300 transitions. [2024-11-10 00:53:45,608 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 2300 transitions. Word has length 56 [2024-11-10 00:53:45,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:45,608 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 2300 transitions. [2024-11-10 00:53:45,608 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:53:45,609 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 2300 transitions. [2024-11-10 00:53:45,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:53:45,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:45,610 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:53:45,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:53:45,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:45,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:45,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1673221541, now seen corresponding path program 1 times [2024-11-10 00:53:45,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:45,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089225535] [2024-11-10 00:53:45,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:45,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:45,836 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:53:45,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:45,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089225535] [2024-11-10 00:53:45,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089225535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:45,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:45,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:53:45,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320742019] [2024-11-10 00:53:45,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:45,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:53:45,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:45,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:53:45,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:53:45,839 INFO L87 Difference]: Start difference. First operand 884 states and 2300 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:53:45,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:45,996 INFO L93 Difference]: Finished difference Result 978 states and 2444 transitions. [2024-11-10 00:53:45,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:53:45,997 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:53:45,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:46,000 INFO L225 Difference]: With dead ends: 978 [2024-11-10 00:53:46,001 INFO L226 Difference]: Without dead ends: 887 [2024-11-10 00:53:46,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:53:46,002 INFO L432 NwaCegarLoop]: 2224 mSDtfsCounter, 6540 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6540 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:53:46,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6540 Valid, 2501 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:53:46,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-11-10 00:53:46,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 884. [2024-11-10 00:53:46,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 882 states have (on average 2.606575963718821) internal successors, (2299), 883 states have internal predecessors, (2299), 0 states have call successors, (0), 0 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:53:46,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 2299 transitions. [2024-11-10 00:53:46,020 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 2299 transitions. Word has length 58 [2024-11-10 00:53:46,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:46,020 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 2299 transitions. [2024-11-10 00:53:46,021 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:53:46,021 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 2299 transitions. [2024-11-10 00:53:46,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 00:53:46,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:46,022 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:53:46,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:53:46,022 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:46,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:46,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1393558986, now seen corresponding path program 1 times [2024-11-10 00:53:46,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:46,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462318768] [2024-11-10 00:53:46,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:46,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:46,108 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:53:46,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:46,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462318768] [2024-11-10 00:53:46,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462318768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:46,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:46,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:53:46,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029805087] [2024-11-10 00:53:46,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:46,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:53:46,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:46,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:53:46,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:53:46,111 INFO L87 Difference]: Start difference. First operand 884 states and 2299 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:53:46,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:46,150 INFO L93 Difference]: Finished difference Result 1054 states and 2561 transitions. [2024-11-10 00:53:46,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:53:46,150 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:53:46,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:46,155 INFO L225 Difference]: With dead ends: 1054 [2024-11-10 00:53:46,155 INFO L226 Difference]: Without dead ends: 963 [2024-11-10 00:53:46,155 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:53:46,157 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:53:46,157 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:53:46,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-10 00:53:46,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 958. [2024-11-10 00:53:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 956 states have (on average 2.521966527196653) internal successors, (2411), 957 states have internal predecessors, (2411), 0 states have call successors, (0), 0 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:53:46,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 2411 transitions. [2024-11-10 00:53:46,178 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 2411 transitions. Word has length 59 [2024-11-10 00:53:46,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:46,178 INFO L471 AbstractCegarLoop]: Abstraction has 958 states and 2411 transitions. [2024-11-10 00:53:46,179 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:53:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 2411 transitions. [2024-11-10 00:53:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:53:46,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:46,180 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:53:46,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:53:46,181 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:46,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:46,182 INFO L85 PathProgramCache]: Analyzing trace with hash 691569053, now seen corresponding path program 1 times [2024-11-10 00:53:46,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:46,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790496317] [2024-11-10 00:53:46,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:46,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:46,231 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:53:46,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:46,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790496317] [2024-11-10 00:53:46,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790496317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:46,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:46,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:53:46,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325536631] [2024-11-10 00:53:46,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:46,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:53:46,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:46,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:53:46,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:53:46,233 INFO L87 Difference]: Start difference. First operand 958 states and 2411 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:53:46,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:46,263 INFO L93 Difference]: Finished difference Result 1272 states and 2889 transitions. [2024-11-10 00:53:46,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:53:46,264 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:53:46,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:46,269 INFO L225 Difference]: With dead ends: 1272 [2024-11-10 00:53:46,269 INFO L226 Difference]: Without dead ends: 1107 [2024-11-10 00:53:46,270 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:53:46,272 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:53:46,274 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:53:46,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2024-11-10 00:53:46,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1104. [2024-11-10 00:53:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1102 states have (on average 2.386569872958258) internal successors, (2630), 1103 states have internal predecessors, (2630), 0 states have call successors, (0), 0 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:53:46,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 2630 transitions. [2024-11-10 00:53:46,298 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 2630 transitions. Word has length 60 [2024-11-10 00:53:46,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:46,298 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 2630 transitions. [2024-11-10 00:53:46,298 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:53:46,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 2630 transitions. [2024-11-10 00:53:46,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:53:46,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:46,299 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:53:46,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:53:46,299 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:46,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:46,300 INFO L85 PathProgramCache]: Analyzing trace with hash -309840675, now seen corresponding path program 1 times [2024-11-10 00:53:46,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:46,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720892370] [2024-11-10 00:53:46,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:46,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:46,363 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:53:46,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:46,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720892370] [2024-11-10 00:53:46,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720892370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:46,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:46,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:53:46,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073363867] [2024-11-10 00:53:46,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:46,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:53:46,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:46,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:53:46,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:53:46,365 INFO L87 Difference]: Start difference. First operand 1104 states and 2630 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:53:46,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:46,423 INFO L93 Difference]: Finished difference Result 1694 states and 3518 transitions. [2024-11-10 00:53:46,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:53:46,423 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:53:46,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:46,429 INFO L225 Difference]: With dead ends: 1694 [2024-11-10 00:53:46,430 INFO L226 Difference]: Without dead ends: 1383 [2024-11-10 00:53:46,430 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:53:46,432 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:53:46,432 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:53:46,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-11-10 00:53:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1380. [2024-11-10 00:53:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1378 states have (on average 2.2031930333817127) internal successors, (3036), 1379 states have internal predecessors, (3036), 0 states have call successors, (0), 0 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:53:46,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 3036 transitions. [2024-11-10 00:53:46,456 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 3036 transitions. Word has length 60 [2024-11-10 00:53:46,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:46,456 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 3036 transitions. [2024-11-10 00:53:46,457 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:53:46,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 3036 transitions. [2024-11-10 00:53:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:53:46,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:46,457 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:53:46,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:53:46,458 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:46,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:46,458 INFO L85 PathProgramCache]: Analyzing trace with hash -324290531, now seen corresponding path program 1 times [2024-11-10 00:53:46,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:46,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021446970] [2024-11-10 00:53:46,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:46,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:46,496 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:53:46,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:46,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021446970] [2024-11-10 00:53:46,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021446970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:46,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:46,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:53:46,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93750703] [2024-11-10 00:53:46,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:46,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:53:46,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:46,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:53:46,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:53:46,502 INFO L87 Difference]: Start difference. First operand 1380 states and 3036 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:53:46,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:46,534 INFO L93 Difference]: Finished difference Result 2490 states and 4680 transitions. [2024-11-10 00:53:46,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:53:46,534 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:53:46,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:46,541 INFO L225 Difference]: With dead ends: 2490 [2024-11-10 00:53:46,542 INFO L226 Difference]: Without dead ends: 1903 [2024-11-10 00:53:46,543 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:53:46,544 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:53:46,544 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:53:46,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2024-11-10 00:53:46,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1900. [2024-11-10 00:53:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1900 states, 1898 states have (on average 1.993677555321391) internal successors, (3784), 1899 states have internal predecessors, (3784), 0 states have call successors, (0), 0 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:53:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 3784 transitions. [2024-11-10 00:53:46,596 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 3784 transitions. Word has length 60 [2024-11-10 00:53:46,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:46,597 INFO L471 AbstractCegarLoop]: Abstraction has 1900 states and 3784 transitions. [2024-11-10 00:53:46,597 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:53:46,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 3784 transitions. [2024-11-10 00:53:46,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:53:46,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:46,598 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:53:46,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:53:46,598 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:46,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:46,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1767312221, now seen corresponding path program 1 times [2024-11-10 00:53:46,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:46,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381504574] [2024-11-10 00:53:46,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:46,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:46,657 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:53:46,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:46,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381504574] [2024-11-10 00:53:46,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381504574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:46,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:46,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:53:46,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771837294] [2024-11-10 00:53:46,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:46,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:53:46,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:46,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:53:46,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:53:46,660 INFO L87 Difference]: Start difference. First operand 1900 states and 3784 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:53:46,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:46,712 INFO L93 Difference]: Finished difference Result 3986 states and 6812 transitions. [2024-11-10 00:53:46,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:53:46,713 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:53:46,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:46,725 INFO L225 Difference]: With dead ends: 3986 [2024-11-10 00:53:46,725 INFO L226 Difference]: Without dead ends: 2879 [2024-11-10 00:53:46,729 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:53:46,731 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:53:46,732 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:53:46,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2024-11-10 00:53:46,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2876. [2024-11-10 00:53:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2874 states have (on average 1.7926235212247739) internal successors, (5152), 2875 states have internal predecessors, (5152), 0 states have call successors, (0), 0 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:53:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 5152 transitions. [2024-11-10 00:53:46,790 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 5152 transitions. Word has length 60 [2024-11-10 00:53:46,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:46,790 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 5152 transitions. [2024-11-10 00:53:46,790 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:53:46,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 5152 transitions. [2024-11-10 00:53:46,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:53:46,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:46,791 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:53:46,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:53:46,791 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:46,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:46,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1243035166, now seen corresponding path program 1 times [2024-11-10 00:53:46,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:46,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878735346] [2024-11-10 00:53:46,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:46,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:46,972 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:53:46,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:46,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878735346] [2024-11-10 00:53:46,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878735346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:46,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:46,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:53:46,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744339693] [2024-11-10 00:53:46,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:46,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:53:46,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:46,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:53:46,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:53:46,974 INFO L87 Difference]: Start difference. First operand 2876 states and 5152 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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:53:47,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:47,055 INFO L93 Difference]: Finished difference Result 2975 states and 5282 transitions. [2024-11-10 00:53:47,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:53:47,056 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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:53:47,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:47,064 INFO L225 Difference]: With dead ends: 2975 [2024-11-10 00:53:47,065 INFO L226 Difference]: Without dead ends: 2972 [2024-11-10 00:53:47,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:53:47,067 INFO L432 NwaCegarLoop]: 2225 mSDtfsCounter, 0 mSDsluCounter, 13337 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15562 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:53:47,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15562 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:53:47,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2024-11-10 00:53:47,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 2972. [2024-11-10 00:53:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2972 states, 2970 states have (on average 1.7616161616161616) internal successors, (5232), 2971 states have internal predecessors, (5232), 0 states have call successors, (0), 0 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:53:47,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2972 states to 2972 states and 5232 transitions. [2024-11-10 00:53:47,121 INFO L78 Accepts]: Start accepts. Automaton has 2972 states and 5232 transitions. Word has length 60 [2024-11-10 00:53:47,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:47,121 INFO L471 AbstractCegarLoop]: Abstraction has 2972 states and 5232 transitions. [2024-11-10 00:53:47,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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:53:47,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2972 states and 5232 transitions. [2024-11-10 00:53:47,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 00:53:47,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:47,122 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:53:47,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:53:47,122 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:47,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:47,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1092605501, now seen corresponding path program 1 times [2024-11-10 00:53:47,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:47,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543192541] [2024-11-10 00:53:47,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:47,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:47,170 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:53:47,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:47,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543192541] [2024-11-10 00:53:47,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543192541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:47,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:47,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:53:47,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990084300] [2024-11-10 00:53:47,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:47,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:53:47,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:47,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:53:47,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:53:47,172 INFO L87 Difference]: Start difference. First operand 2972 states and 5232 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:53:47,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:47,255 INFO L93 Difference]: Finished difference Result 5286 states and 8537 transitions. [2024-11-10 00:53:47,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:53:47,255 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:53:47,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:47,266 INFO L225 Difference]: With dead ends: 5286 [2024-11-10 00:53:47,266 INFO L226 Difference]: Without dead ends: 4034 [2024-11-10 00:53:47,267 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:53:47,268 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:53:47,268 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:53:47,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states. [2024-11-10 00:53:47,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4031. [2024-11-10 00:53:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4031 states, 4029 states have (on average 1.6607098535616778) internal successors, (6691), 4030 states have internal predecessors, (6691), 0 states have call successors, (0), 0 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:53:47,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 6691 transitions. [2024-11-10 00:53:47,339 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 6691 transitions. Word has length 62 [2024-11-10 00:53:47,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:47,339 INFO L471 AbstractCegarLoop]: Abstraction has 4031 states and 6691 transitions. [2024-11-10 00:53:47,339 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:53:47,339 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 6691 transitions. [2024-11-10 00:53:47,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 00:53:47,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:47,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:53:47,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:53:47,342 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:47,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:47,343 INFO L85 PathProgramCache]: Analyzing trace with hash 604314728, now seen corresponding path program 1 times [2024-11-10 00:53:47,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:47,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12650801] [2024-11-10 00:53:47,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:47,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:47,443 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:53:47,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:47,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12650801] [2024-11-10 00:53:47,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12650801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:47,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:47,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:53:47,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494952661] [2024-11-10 00:53:47,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:47,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:53:47,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:47,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:53:47,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:53:47,445 INFO L87 Difference]: Start difference. First operand 4031 states and 6691 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 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:53:53,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:53,885 INFO L93 Difference]: Finished difference Result 6290 states and 13044 transitions. [2024-11-10 00:53:53,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:53:53,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-10 00:53:53,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:53,901 INFO L225 Difference]: With dead ends: 6290 [2024-11-10 00:53:53,901 INFO L226 Difference]: Without dead ends: 5535 [2024-11-10 00:53:53,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:53:53,903 INFO L432 NwaCegarLoop]: 787 mSDtfsCounter, 4449 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 8074 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4449 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 9227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 8074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:53:53,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4449 Valid, 810 Invalid, 9227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 8074 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-10 00:53:53,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states. [2024-11-10 00:53:53,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 5535. [2024-11-10 00:53:54,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5535 states, 5533 states have (on average 1.8375203325501537) internal successors, (10167), 5534 states have internal predecessors, (10167), 0 states have call successors, (0), 0 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:53:54,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5535 states to 5535 states and 10167 transitions. [2024-11-10 00:53:54,015 INFO L78 Accepts]: Start accepts. Automaton has 5535 states and 10167 transitions. Word has length 65 [2024-11-10 00:53:54,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:54,015 INFO L471 AbstractCegarLoop]: Abstraction has 5535 states and 10167 transitions. [2024-11-10 00:53:54,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 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:53:54,016 INFO L276 IsEmpty]: Start isEmpty. Operand 5535 states and 10167 transitions. [2024-11-10 00:53:54,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:53:54,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:54,017 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:53:54,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:53:54,018 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:54,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:54,018 INFO L85 PathProgramCache]: Analyzing trace with hash 304318565, now seen corresponding path program 1 times [2024-11-10 00:53:54,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:54,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223321495] [2024-11-10 00:53:54,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:54,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:54,156 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:53:54,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:54,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223321495] [2024-11-10 00:53:54,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223321495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:54,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:54,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:53:54,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441438347] [2024-11-10 00:53:54,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:54,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:53:54,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:54,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:53:54,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:53:54,158 INFO L87 Difference]: Start difference. First operand 5535 states and 10167 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:53:54,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:54,439 INFO L93 Difference]: Finished difference Result 22417 states and 33763 transitions. [2024-11-10 00:53:54,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:53:54,440 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:53:54,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:54,471 INFO L225 Difference]: With dead ends: 22417 [2024-11-10 00:53:54,471 INFO L226 Difference]: Without dead ends: 19182 [2024-11-10 00:53:54,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:53:54,481 INFO L432 NwaCegarLoop]: 2303 mSDtfsCounter, 9080 mSDsluCounter, 2729 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9080 SdHoareTripleChecker+Valid, 5032 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:53:54,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9080 Valid, 5032 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:53:54,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19182 states. [2024-11-10 00:53:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19182 to 8767. [2024-11-10 00:53:54,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8767 states, 8765 states have (on average 1.6710781517398745) internal successors, (14647), 8766 states have internal predecessors, (14647), 0 states have call successors, (0), 0 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:53:54,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8767 states to 8767 states and 14647 transitions. [2024-11-10 00:53:54,707 INFO L78 Accepts]: Start accepts. Automaton has 8767 states and 14647 transitions. Word has length 81 [2024-11-10 00:53:54,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:54,708 INFO L471 AbstractCegarLoop]: Abstraction has 8767 states and 14647 transitions. [2024-11-10 00:53:54,708 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:53:54,709 INFO L276 IsEmpty]: Start isEmpty. Operand 8767 states and 14647 transitions. [2024-11-10 00:53:54,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:53:54,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:54,710 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:53:54,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:53:54,711 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:54,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:54,711 INFO L85 PathProgramCache]: Analyzing trace with hash -697091163, now seen corresponding path program 1 times [2024-11-10 00:53:54,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:54,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503627562] [2024-11-10 00:53:54,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:54,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:54,847 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:53:54,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:54,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503627562] [2024-11-10 00:53:54,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503627562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:54,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:54,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:53:54,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427789572] [2024-11-10 00:53:54,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:54,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:53:54,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:54,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:53:54,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:53:54,849 INFO L87 Difference]: Start difference. First operand 8767 states and 14647 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:53:55,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:55,226 INFO L93 Difference]: Finished difference Result 25649 states and 38243 transitions. [2024-11-10 00:53:55,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:53:55,227 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:53:55,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:55,261 INFO L225 Difference]: With dead ends: 25649 [2024-11-10 00:53:55,261 INFO L226 Difference]: Without dead ends: 22414 [2024-11-10 00:53:55,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:53:55,273 INFO L432 NwaCegarLoop]: 2299 mSDtfsCounter, 9102 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9102 SdHoareTripleChecker+Valid, 4973 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:53:55,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9102 Valid, 4973 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:53:55,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22414 states. [2024-11-10 00:53:55,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22414 to 13631. [2024-11-10 00:53:55,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13631 states, 13629 states have (on average 1.5654119891408027) internal successors, (21335), 13630 states have internal predecessors, (21335), 0 states have call successors, (0), 0 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:53:55,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13631 states to 13631 states and 21335 transitions. [2024-11-10 00:53:55,580 INFO L78 Accepts]: Start accepts. Automaton has 13631 states and 21335 transitions. Word has length 81 [2024-11-10 00:53:55,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:55,580 INFO L471 AbstractCegarLoop]: Abstraction has 13631 states and 21335 transitions. [2024-11-10 00:53:55,581 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:53:55,581 INFO L276 IsEmpty]: Start isEmpty. Operand 13631 states and 21335 transitions. [2024-11-10 00:53:55,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:53:55,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:55,583 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:53:55,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:53:55,583 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:55,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:55,583 INFO L85 PathProgramCache]: Analyzing trace with hash -711541019, now seen corresponding path program 1 times [2024-11-10 00:53:55,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:55,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673145220] [2024-11-10 00:53:55,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:55,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:55,701 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:53:55,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:55,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673145220] [2024-11-10 00:53:55,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673145220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:55,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:55,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:53:55,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544691292] [2024-11-10 00:53:55,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:55,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:53:55,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:55,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:53:55,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:53:55,703 INFO L87 Difference]: Start difference. First operand 13631 states and 21335 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:53:56,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:56,128 INFO L93 Difference]: Finished difference Result 28881 states and 42723 transitions. [2024-11-10 00:53:56,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:53:56,128 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:53:56,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:56,168 INFO L225 Difference]: With dead ends: 28881 [2024-11-10 00:53:56,169 INFO L226 Difference]: Without dead ends: 25646 [2024-11-10 00:53:56,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:53:56,182 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:53:56,182 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:53:56,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25646 states. [2024-11-10 00:53:56,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25646 to 16863. [2024-11-10 00:53:56,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16863 states, 16861 states have (on average 1.531047980546824) internal successors, (25815), 16862 states have internal predecessors, (25815), 0 states have call successors, (0), 0 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:53:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16863 states to 16863 states and 25815 transitions. [2024-11-10 00:53:56,539 INFO L78 Accepts]: Start accepts. Automaton has 16863 states and 25815 transitions. Word has length 81 [2024-11-10 00:53:56,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:56,540 INFO L471 AbstractCegarLoop]: Abstraction has 16863 states and 25815 transitions. [2024-11-10 00:53:56,540 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:53:56,540 INFO L276 IsEmpty]: Start isEmpty. Operand 16863 states and 25815 transitions. [2024-11-10 00:53:56,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:53:56,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:56,542 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:53:56,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:53:56,542 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:56,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:56,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1380061733, now seen corresponding path program 1 times [2024-11-10 00:53:56,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:56,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316199199] [2024-11-10 00:53:56,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:56,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:56,741 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:53:56,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:56,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316199199] [2024-11-10 00:53:56,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316199199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:56,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:56,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:53:56,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976506302] [2024-11-10 00:53:56,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:56,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:53:56,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:56,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:53:56,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:53:56,743 INFO L87 Difference]: Start difference. First operand 16863 states and 25815 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:53:57,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:57,248 INFO L93 Difference]: Finished difference Result 32113 states and 47203 transitions. [2024-11-10 00:53:57,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:53:57,248 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:53:57,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:57,292 INFO L225 Difference]: With dead ends: 32113 [2024-11-10 00:53:57,292 INFO L226 Difference]: Without dead ends: 28878 [2024-11-10 00:53:57,304 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:53:57,304 INFO L432 NwaCegarLoop]: 2301 mSDtfsCounter, 9090 mSDsluCounter, 2711 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9090 SdHoareTripleChecker+Valid, 5012 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:53:57,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9090 Valid, 5012 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:53:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28878 states. [2024-11-10 00:53:57,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28878 to 20095. [2024-11-10 00:53:57,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20095 states, 20093 states have (on average 1.5077390135868214) internal successors, (30295), 20094 states have internal predecessors, (30295), 0 states have call successors, (0), 0 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:53:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20095 states to 20095 states and 30295 transitions. [2024-11-10 00:53:57,782 INFO L78 Accepts]: Start accepts. Automaton has 20095 states and 30295 transitions. Word has length 81 [2024-11-10 00:53:57,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:57,782 INFO L471 AbstractCegarLoop]: Abstraction has 20095 states and 30295 transitions. [2024-11-10 00:53:57,782 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:53:57,783 INFO L276 IsEmpty]: Start isEmpty. Operand 20095 states and 30295 transitions. [2024-11-10 00:53:57,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:53:57,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:57,785 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:53:57,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:53:57,786 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:57,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:57,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1613241913, now seen corresponding path program 1 times [2024-11-10 00:53:57,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:57,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082359812] [2024-11-10 00:53:57,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:57,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:57,871 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:53:57,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:57,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082359812] [2024-11-10 00:53:57,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082359812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:57,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:57,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:53:57,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647522021] [2024-11-10 00:53:57,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:57,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:53:57,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:57,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:53:57,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:53:57,873 INFO L87 Difference]: Start difference. First operand 20095 states and 30295 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:53:58,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:58,047 INFO L93 Difference]: Finished difference Result 32795 states and 48098 transitions. [2024-11-10 00:53:58,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:53:58,047 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:53:58,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:58,066 INFO L225 Difference]: With dead ends: 32795 [2024-11-10 00:53:58,066 INFO L226 Difference]: Without dead ends: 15000 [2024-11-10 00:53:58,081 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:53:58,082 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:53:58,082 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:53:58,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15000 states. [2024-11-10 00:53:58,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15000 to 14997. [2024-11-10 00:53:58,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14997 states, 14995 states have (on average 1.5512504168056018) internal successors, (23261), 14996 states have internal predecessors, (23261), 0 states have call successors, (0), 0 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:53:58,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14997 states to 14997 states and 23261 transitions. [2024-11-10 00:53:58,351 INFO L78 Accepts]: Start accepts. Automaton has 14997 states and 23261 transitions. Word has length 83 [2024-11-10 00:53:58,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:58,352 INFO L471 AbstractCegarLoop]: Abstraction has 14997 states and 23261 transitions. [2024-11-10 00:53:58,352 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:53:58,352 INFO L276 IsEmpty]: Start isEmpty. Operand 14997 states and 23261 transitions. [2024-11-10 00:53:58,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:53:58,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:58,355 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:53:58,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:53:58,355 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:58,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:58,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1687926011, now seen corresponding path program 1 times [2024-11-10 00:53:58,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:58,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941298368] [2024-11-10 00:53:58,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:58,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:58,478 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:53:58,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:58,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941298368] [2024-11-10 00:53:58,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941298368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:58,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:58,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:53:58,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311633228] [2024-11-10 00:53:58,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:58,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:53:58,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:58,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:53:58,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:53:58,480 INFO L87 Difference]: Start difference. First operand 14997 states and 23261 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:53:58,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:58,895 INFO L93 Difference]: Finished difference Result 26535 states and 39433 transitions. [2024-11-10 00:53:58,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:53:58,896 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:53:58,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:58,921 INFO L225 Difference]: With dead ends: 26535 [2024-11-10 00:53:58,921 INFO L226 Difference]: Without dead ends: 24228 [2024-11-10 00:53:58,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:53:58,930 INFO L432 NwaCegarLoop]: 2293 mSDtfsCounter, 9089 mSDsluCounter, 2853 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9089 SdHoareTripleChecker+Valid, 5146 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:53:58,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9089 Valid, 5146 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:53:58,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24228 states. [2024-11-10 00:53:59,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24228 to 17301. [2024-11-10 00:53:59,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17301 states, 17299 states have (on average 1.5296259899416151) internal successors, (26461), 17300 states have internal predecessors, (26461), 0 states have call successors, (0), 0 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:53:59,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17301 states to 17301 states and 26461 transitions. [2024-11-10 00:53:59,261 INFO L78 Accepts]: Start accepts. Automaton has 17301 states and 26461 transitions. Word has length 83 [2024-11-10 00:53:59,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:59,261 INFO L471 AbstractCegarLoop]: Abstraction has 17301 states and 26461 transitions. [2024-11-10 00:53:59,262 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:53:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 17301 states and 26461 transitions. [2024-11-10 00:53:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 00:53:59,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:59,264 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:53:59,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:53:59,265 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:59,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:59,265 INFO L85 PathProgramCache]: Analyzing trace with hash -604865433, now seen corresponding path program 1 times [2024-11-10 00:53:59,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:59,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555280076] [2024-11-10 00:53:59,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:59,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:59,355 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:53:59,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:59,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555280076] [2024-11-10 00:53:59,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555280076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:59,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:59,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:53:59,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067004292] [2024-11-10 00:53:59,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:59,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:53:59,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:59,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:53:59,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:53:59,357 INFO L87 Difference]: Start difference. First operand 17301 states and 26461 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:53:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:59,532 INFO L93 Difference]: Finished difference Result 24795 states and 36865 transitions. [2024-11-10 00:53:59,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:53:59,532 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:53:59,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:59,543 INFO L225 Difference]: With dead ends: 24795 [2024-11-10 00:53:59,544 INFO L226 Difference]: Without dead ends: 9816 [2024-11-10 00:53:59,551 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:53:59,552 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:53:59,552 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:53:59,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9816 states. [2024-11-10 00:53:59,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9816 to 9813. [2024-11-10 00:53:59,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9813 states, 9811 states have (on average 1.626439710528998) internal successors, (15957), 9812 states have internal predecessors, (15957), 0 states have call successors, (0), 0 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:53:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9813 states to 9813 states and 15957 transitions. [2024-11-10 00:53:59,717 INFO L78 Accepts]: Start accepts. Automaton has 9813 states and 15957 transitions. Word has length 85 [2024-11-10 00:53:59,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:59,717 INFO L471 AbstractCegarLoop]: Abstraction has 9813 states and 15957 transitions. [2024-11-10 00:53:59,717 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:53:59,717 INFO L276 IsEmpty]: Start isEmpty. Operand 9813 states and 15957 transitions. [2024-11-10 00:53:59,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 00:53:59,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:59,719 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:53:59,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:53:59,719 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:59,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:59,719 INFO L85 PathProgramCache]: Analyzing trace with hash 884605097, now seen corresponding path program 1 times [2024-11-10 00:53:59,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:59,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322219783] [2024-11-10 00:53:59,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:59,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:59,809 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:53:59,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:59,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322219783] [2024-11-10 00:53:59,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322219783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:59,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:59,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:53:59,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759613158] [2024-11-10 00:53:59,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:59,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:53:59,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:59,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:53:59,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:53:59,811 INFO L87 Difference]: Start difference. First operand 9813 states and 15957 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:53:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:59,885 INFO L93 Difference]: Finished difference Result 13563 states and 21109 transitions. [2024-11-10 00:53:59,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:53:59,885 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:53:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:59,893 INFO L225 Difference]: With dead ends: 13563 [2024-11-10 00:53:59,894 INFO L226 Difference]: Without dead ends: 6072 [2024-11-10 00:53:59,902 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:53:59,903 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:53:59,903 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:53:59,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2024-11-10 00:53:59,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 6069. [2024-11-10 00:53:59,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6069 states, 6067 states have (on average 1.7730344486566672) internal successors, (10757), 6068 states have internal predecessors, (10757), 0 states have call successors, (0), 0 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:54:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6069 states to 6069 states and 10757 transitions. [2024-11-10 00:54:00,002 INFO L78 Accepts]: Start accepts. Automaton has 6069 states and 10757 transitions. Word has length 87 [2024-11-10 00:54:00,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:00,002 INFO L471 AbstractCegarLoop]: Abstraction has 6069 states and 10757 transitions. [2024-11-10 00:54:00,002 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:54:00,002 INFO L276 IsEmpty]: Start isEmpty. Operand 6069 states and 10757 transitions. [2024-11-10 00:54:00,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 00:54:00,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:00,004 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:54:00,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:54:00,004 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:00,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:00,005 INFO L85 PathProgramCache]: Analyzing trace with hash -2145385200, now seen corresponding path program 1 times [2024-11-10 00:54:00,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:00,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619542534] [2024-11-10 00:54:00,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:00,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:00,101 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:54:00,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:00,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619542534] [2024-11-10 00:54:00,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619542534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:00,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:00,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:00,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732867528] [2024-11-10 00:54:00,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:00,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:00,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:00,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:00,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:00,103 INFO L87 Difference]: Start difference. First operand 6069 states and 10757 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:54:00,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:00,149 INFO L93 Difference]: Finished difference Result 7947 states and 13309 transitions. [2024-11-10 00:54:00,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:00,150 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:54:00,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:00,155 INFO L225 Difference]: With dead ends: 7947 [2024-11-10 00:54:00,156 INFO L226 Difference]: Without dead ends: 4200 [2024-11-10 00:54:00,159 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:54:00,159 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:54:00,160 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:54:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4200 states. [2024-11-10 00:54:00,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4200 to 4197. [2024-11-10 00:54:00,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4197 states, 4195 states have (on average 1.9506555423122764) internal successors, (8183), 4196 states have internal predecessors, (8183), 0 states have call successors, (0), 0 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:54:00,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4197 states to 4197 states and 8183 transitions. [2024-11-10 00:54:00,223 INFO L78 Accepts]: Start accepts. Automaton has 4197 states and 8183 transitions. Word has length 89 [2024-11-10 00:54:00,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:00,223 INFO L471 AbstractCegarLoop]: Abstraction has 4197 states and 8183 transitions. [2024-11-10 00:54:00,223 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:54:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand 4197 states and 8183 transitions. [2024-11-10 00:54:00,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 00:54:00,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:00,224 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:54:00,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:54:00,224 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:00,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:00,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2015095447, now seen corresponding path program 1 times [2024-11-10 00:54:00,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:00,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254529392] [2024-11-10 00:54:00,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:00,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:00,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:54:00,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:00,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254529392] [2024-11-10 00:54:00,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254529392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:00,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:00,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:00,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640782932] [2024-11-10 00:54:00,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:00,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:00,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:00,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:00,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:00,287 INFO L87 Difference]: Start difference. First operand 4197 states and 8183 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:54:00,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:00,321 INFO L93 Difference]: Finished difference Result 5139 states and 9448 transitions. [2024-11-10 00:54:00,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:00,321 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:54:00,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:00,326 INFO L225 Difference]: With dead ends: 5139 [2024-11-10 00:54:00,326 INFO L226 Difference]: Without dead ends: 3264 [2024-11-10 00:54:00,328 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:54:00,328 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:54:00,328 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:54:00,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2024-11-10 00:54:00,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 3261. [2024-11-10 00:54:00,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3261 states, 3259 states have (on average 2.11997545259282) internal successors, (6909), 3260 states have internal predecessors, (6909), 0 states have call successors, (0), 0 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:54:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3261 states to 3261 states and 6909 transitions. [2024-11-10 00:54:00,369 INFO L78 Accepts]: Start accepts. Automaton has 3261 states and 6909 transitions. Word has length 91 [2024-11-10 00:54:00,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:00,369 INFO L471 AbstractCegarLoop]: Abstraction has 3261 states and 6909 transitions. [2024-11-10 00:54:00,369 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:54:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3261 states and 6909 transitions. [2024-11-10 00:54:00,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 00:54:00,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:00,370 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:54:00,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 00:54:00,370 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:00,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:00,371 INFO L85 PathProgramCache]: Analyzing trace with hash -196861634, now seen corresponding path program 1 times [2024-11-10 00:54:00,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:00,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519397559] [2024-11-10 00:54:00,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:00,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:00,777 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:54:00,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:00,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519397559] [2024-11-10 00:54:00,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519397559] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:54:00,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937712211] [2024-11-10 00:54:00,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:00,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:54:00,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:54:00,779 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:54:00,781 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:54:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:00,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:54:00,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:54:01,481 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:54:01,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:54:02,632 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:54:02,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937712211] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:54:02,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:54:02,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-10 00:54:02,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828149617] [2024-11-10 00:54:02,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:54:02,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 00:54:02,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:02,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 00:54:02,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2024-11-10 00:54:02,634 INFO L87 Difference]: Start difference. First operand 3261 states and 6909 transitions. Second operand has 25 states, 25 states have (on average 10.44) internal successors, (261), 24 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:03,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:03,957 INFO L93 Difference]: Finished difference Result 7286 states and 12279 transitions. [2024-11-10 00:54:03,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-10 00:54:03,958 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.44) internal successors, (261), 24 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-11-10 00:54:03,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:03,966 INFO L225 Difference]: With dead ends: 7286 [2024-11-10 00:54:03,966 INFO L226 Difference]: Without dead ends: 6347 [2024-11-10 00:54:03,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=551, Invalid=2205, Unknown=0, NotChecked=0, Total=2756 [2024-11-10 00:54:03,970 INFO L432 NwaCegarLoop]: 2189 mSDtfsCounter, 22704 mSDsluCounter, 7374 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22704 SdHoareTripleChecker+Valid, 9563 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:03,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22704 Valid, 9563 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:54:03,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6347 states. [2024-11-10 00:54:04,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6347 to 6277. [2024-11-10 00:54:04,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6277 states, 6275 states have (on average 1.7225498007968127) internal successors, (10809), 6276 states have internal predecessors, (10809), 0 states have call successors, (0), 0 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:54:04,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6277 states to 6277 states and 10809 transitions. [2024-11-10 00:54:04,079 INFO L78 Accepts]: Start accepts. Automaton has 6277 states and 10809 transitions. Word has length 93 [2024-11-10 00:54:04,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:04,080 INFO L471 AbstractCegarLoop]: Abstraction has 6277 states and 10809 transitions. [2024-11-10 00:54:04,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.44) internal successors, (261), 24 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:04,080 INFO L276 IsEmpty]: Start isEmpty. Operand 6277 states and 10809 transitions. [2024-11-10 00:54:04,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 00:54:04,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:04,082 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:54:04,096 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:54:04,285 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,SelfDestructingSolverStorable22 [2024-11-10 00:54:04,286 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:04,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:04,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1391570274, now seen corresponding path program 1 times [2024-11-10 00:54:04,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:04,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45397712] [2024-11-10 00:54:04,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:04,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:04,605 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:54:04,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:04,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45397712] [2024-11-10 00:54:04,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45397712] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:54:04,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471610150] [2024-11-10 00:54:04,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:04,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:54:04,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:54:04,608 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:54:04,609 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:54:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:04,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 00:54:04,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:54:05,072 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:54:05,073 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:54:05,680 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:54:05,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471610150] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:54:05,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:54:05,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-10 00:54:05,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621718731] [2024-11-10 00:54:05,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:54:05,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 00:54:05,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:05,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 00:54:05,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2024-11-10 00:54:05,682 INFO L87 Difference]: Start difference. First operand 6277 states and 10809 transitions. Second operand has 25 states, 25 states have (on average 9.16) internal successors, (229), 24 states have internal predecessors, (229), 0 states have call successors, (0), 0 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:54:06,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:06,864 INFO L93 Difference]: Finished difference Result 16572 states and 24247 transitions. [2024-11-10 00:54:06,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-10 00:54:06,864 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 9.16) internal successors, (229), 24 states have internal predecessors, (229), 0 states have call successors, (0), 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:54:06,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:06,878 INFO L225 Difference]: With dead ends: 16572 [2024-11-10 00:54:06,878 INFO L226 Difference]: Without dead ends: 12617 [2024-11-10 00:54:06,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=586, Invalid=2276, Unknown=0, NotChecked=0, Total=2862 [2024-11-10 00:54:06,885 INFO L432 NwaCegarLoop]: 2250 mSDtfsCounter, 24813 mSDsluCounter, 9637 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24813 SdHoareTripleChecker+Valid, 11887 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:06,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24813 Valid, 11887 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:54:06,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12617 states. [2024-11-10 00:54:07,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12617 to 12533. [2024-11-10 00:54:07,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12533 states, 12531 states have (on average 1.5024339637698507) internal successors, (18827), 12532 states have internal predecessors, (18827), 0 states have call successors, (0), 0 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:54:07,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12533 states to 12533 states and 18827 transitions. [2024-11-10 00:54:07,189 INFO L78 Accepts]: Start accepts. Automaton has 12533 states and 18827 transitions. Word has length 93 [2024-11-10 00:54:07,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:07,189 INFO L471 AbstractCegarLoop]: Abstraction has 12533 states and 18827 transitions. [2024-11-10 00:54:07,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.16) internal successors, (229), 24 states have internal predecessors, (229), 0 states have call successors, (0), 0 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:54:07,189 INFO L276 IsEmpty]: Start isEmpty. Operand 12533 states and 18827 transitions. [2024-11-10 00:54:07,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 00:54:07,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:07,192 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:54:07,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 00:54:07,396 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,SelfDestructingSolverStorable23 [2024-11-10 00:54:07,397 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:07,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:07,399 INFO L85 PathProgramCache]: Analyzing trace with hash 799660954, now seen corresponding path program 1 times [2024-11-10 00:54:07,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:07,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865486895] [2024-11-10 00:54:07,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:07,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:07,718 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:54:07,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:07,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865486895] [2024-11-10 00:54:07,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865486895] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:54:07,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420457681] [2024-11-10 00:54:07,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:07,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:54:07,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:54:07,720 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:54:07,722 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:54:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:07,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-10 00:54:07,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:54:31,980 WARN L286 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 299 DAG size of output: 285 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)