./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label08.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.3.ufo.BOUNDED-6.pals+Problem12_label08.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 20bccc5c4039b31e1359e00bb81f308547d82590fa0687937b9518c1e6a7a105 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:47:27,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:47:27,403 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:47:27,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:47:27,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:47:27,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:47:27,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:47:27,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:47:27,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:47:27,431 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:47:27,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:47:27,431 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:47:27,431 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:47:27,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:47:27,432 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:47:27,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:47:27,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:47:27,433 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:47:27,433 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:47:27,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:47:27,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:47:27,436 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:47:27,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:47:27,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:47:27,437 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:47:27,437 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:47:27,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:47:27,440 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:47:27,440 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:47:27,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:47:27,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:47:27,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:47:27,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:47:27,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:47:27,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:47:27,441 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:47:27,442 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:47:27,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:47:27,442 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:47:27,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:47:27,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:47:27,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:47:27,443 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 -> 20bccc5c4039b31e1359e00bb81f308547d82590fa0687937b9518c1e6a7a105 [2024-11-10 00:47:27,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:47:27,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:47:27,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:47:27,690 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:47:27,690 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:47:27,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label08.c [2024-11-10 00:47:28,992 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:47:29,405 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:47:29,406 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label08.c [2024-11-10 00:47:29,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/805e5288c/704c991c8b424303a3903165c437cb78/FLAGace879e60 [2024-11-10 00:47:29,563 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/805e5288c/704c991c8b424303a3903165c437cb78 [2024-11-10 00:47:29,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:47:29,566 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:47:29,568 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:47:29,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:47:29,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:47:29,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:47:29" (1/1) ... [2024-11-10 00:47:29,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a08520b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:29, skipping insertion in model container [2024-11-10 00:47:29,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:47:29" (1/1) ... [2024-11-10 00:47:29,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:47:29,971 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.3.ufo.BOUNDED-6.pals+Problem12_label08.c[6354,6367] [2024-11-10 00:47:30,025 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.3.ufo.BOUNDED-6.pals+Problem12_label08.c[9861,9874] [2024-11-10 00:47:30,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:47:30,518 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:47:30,547 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.3.ufo.BOUNDED-6.pals+Problem12_label08.c[6354,6367] [2024-11-10 00:47:30,558 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.3.ufo.BOUNDED-6.pals+Problem12_label08.c[9861,9874] [2024-11-10 00:47:30,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:47:30,939 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:47:30,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:30 WrapperNode [2024-11-10 00:47:30,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:47:30,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:47:30,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:47:30,941 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:47:30,954 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:47:30" (1/1) ... [2024-11-10 00:47:31,051 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:47:30" (1/1) ... [2024-11-10 00:47:31,423 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4981 [2024-11-10 00:47:31,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:47:31,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:47:31,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:47:31,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:47:31,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:30" (1/1) ... [2024-11-10 00:47:31,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:30" (1/1) ... [2024-11-10 00:47:31,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:30" (1/1) ... [2024-11-10 00:47:31,713 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:47:31,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:30" (1/1) ... [2024-11-10 00:47:31,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:30" (1/1) ... [2024-11-10 00:47:31,774 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:30" (1/1) ... [2024-11-10 00:47:31,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:30" (1/1) ... [2024-11-10 00:47:31,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:30" (1/1) ... [2024-11-10 00:47:31,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:30" (1/1) ... [2024-11-10 00:47:31,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:47:31,842 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:47:31,843 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:47:31,843 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:47:31,844 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:30" (1/1) ... [2024-11-10 00:47:31,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:47:31,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:47:31,870 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:47:31,876 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:47:31,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:47:31,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:47:31,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:47:31,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:47:32,073 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:47:32,076 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:47:36,686 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1982: havoc calculate_output_#t~ret30#1; [2024-11-10 00:47:36,686 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3461: havoc calculate_output2_#t~ret31#1; [2024-11-10 00:47:36,687 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4951: havoc calculate_output3_#t~ret32#1; [2024-11-10 00:47:36,904 INFO L? ?]: Removed 2069 outVars from TransFormulas that were not future-live. [2024-11-10 00:47:36,904 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:47:36,931 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:47:36,932 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:47:36,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:47:36 BoogieIcfgContainer [2024-11-10 00:47:36,932 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:47:36,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:47:36,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:47:36,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:47:36,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:47:29" (1/3) ... [2024-11-10 00:47:36,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bce793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:47:36, skipping insertion in model container [2024-11-10 00:47:36,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:30" (2/3) ... [2024-11-10 00:47:36,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bce793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:47:36, skipping insertion in model container [2024-11-10 00:47:36,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:47:36" (3/3) ... [2024-11-10 00:47:36,939 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label08.c [2024-11-10 00:47:36,952 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:47:36,952 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:47:37,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:47:37,118 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;@7eee5e41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:47:37,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:47:37,128 INFO L276 IsEmpty]: Start isEmpty. Operand has 879 states, 876 states have (on average 2.675799086757991) internal successors, (2344), 878 states have internal predecessors, (2344), 0 states have call successors, (0), 0 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:47:37,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 00:47:37,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:37,138 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] [2024-11-10 00:47:37,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:37,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:37,144 INFO L85 PathProgramCache]: Analyzing trace with hash -754437650, now seen corresponding path program 1 times [2024-11-10 00:47:37,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:37,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518881283] [2024-11-10 00:47:37,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:37,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:37,377 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:47:37,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:37,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518881283] [2024-11-10 00:47:37,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518881283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:37,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:37,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:47:37,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26450952] [2024-11-10 00:47:37,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:37,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:47:37,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:37,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:47:37,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:47:37,426 INFO L87 Difference]: Start difference. First operand has 879 states, 876 states have (on average 2.675799086757991) internal successors, (2344), 878 states have internal predecessors, (2344), 0 states have call successors, (0), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:47:37,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:37,512 INFO L93 Difference]: Finished difference Result 1734 states and 4646 transitions. [2024-11-10 00:47:37,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:47:37,514 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-10 00:47:37,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:37,535 INFO L225 Difference]: With dead ends: 1734 [2024-11-10 00:47:37,538 INFO L226 Difference]: Without dead ends: 811 [2024-11-10 00:47:37,546 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:47:37,548 INFO L432 NwaCegarLoop]: 2276 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, 2276 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:47:37,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2276 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:37,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2024-11-10 00:47:37,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2024-11-10 00:47:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 809 states have (on average 2.7305315203955502) internal successors, (2209), 810 states have internal predecessors, (2209), 0 states have call successors, (0), 0 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:47:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 2209 transitions. [2024-11-10 00:47:37,647 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 2209 transitions. Word has length 22 [2024-11-10 00:47:37,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:37,647 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 2209 transitions. [2024-11-10 00:47:37,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:47:37,651 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 2209 transitions. [2024-11-10 00:47:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 00:47:37,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:37,652 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] [2024-11-10 00:47:37,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:47:37,652 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:37,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:37,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1264971827, now seen corresponding path program 1 times [2024-11-10 00:47:37,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:37,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969705299] [2024-11-10 00:47:37,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:37,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:37,801 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:47:37,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:37,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969705299] [2024-11-10 00:47:37,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969705299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:37,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:37,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:47:37,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983314685] [2024-11-10 00:47:37,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:37,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:47:37,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:37,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:47:37,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:47:37,804 INFO L87 Difference]: Start difference. First operand 811 states and 2209 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:47:37,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:37,916 INFO L93 Difference]: Finished difference Result 881 states and 2313 transitions. [2024-11-10 00:47:37,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:47:37,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-10 00:47:37,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:37,920 INFO L225 Difference]: With dead ends: 881 [2024-11-10 00:47:37,920 INFO L226 Difference]: Without dead ends: 844 [2024-11-10 00:47:37,920 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:47:37,921 INFO L432 NwaCegarLoop]: 2205 mSDtfsCounter, 49 mSDsluCounter, 6593 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 8798 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:37,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 8798 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:37,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2024-11-10 00:47:37,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 811. [2024-11-10 00:47:37,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 809 states have (on average 2.710754017305315) internal successors, (2193), 810 states have internal predecessors, (2193), 0 states have call successors, (0), 0 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:47:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 2193 transitions. [2024-11-10 00:47:37,942 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 2193 transitions. Word has length 22 [2024-11-10 00:47:37,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:37,942 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 2193 transitions. [2024-11-10 00:47:37,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:47:37,942 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 2193 transitions. [2024-11-10 00:47:37,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 00:47:37,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:37,943 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:37,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:47:37,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:37,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:37,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1013888428, now seen corresponding path program 1 times [2024-11-10 00:47:37,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:37,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055730377] [2024-11-10 00:47:37,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:37,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:37,988 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:47:37,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:37,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055730377] [2024-11-10 00:47:37,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055730377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:37,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:37,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:47:37,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670880765] [2024-11-10 00:47:37,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:37,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:37,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:37,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:37,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:37,991 INFO L87 Difference]: Start difference. First operand 811 states and 2193 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:42,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:42,167 INFO L93 Difference]: Finished difference Result 2318 states and 6429 transitions. [2024-11-10 00:47:42,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:42,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-10 00:47:42,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:42,189 INFO L225 Difference]: With dead ends: 2318 [2024-11-10 00:47:42,189 INFO L226 Difference]: Without dead ends: 1563 [2024-11-10 00:47:42,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:42,191 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 1515 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3800 mSolverCounterSat, 704 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 4504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 704 IncrementalHoareTripleChecker+Valid, 3800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:42,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 162 Invalid, 4504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [704 Valid, 3800 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-10 00:47:42,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2024-11-10 00:47:42,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2024-11-10 00:47:42,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1561 states have (on average 2.718129404228059) internal successors, (4243), 1562 states have internal predecessors, (4243), 0 states have call successors, (0), 0 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:47:42,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 4243 transitions. [2024-11-10 00:47:42,237 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 4243 transitions. Word has length 32 [2024-11-10 00:47:42,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:42,237 INFO L471 AbstractCegarLoop]: Abstraction has 1563 states and 4243 transitions. [2024-11-10 00:47:42,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:42,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 4243 transitions. [2024-11-10 00:47:42,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 00:47:42,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:42,242 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] [2024-11-10 00:47:42,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:47:42,243 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:42,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:42,244 INFO L85 PathProgramCache]: Analyzing trace with hash 606557701, now seen corresponding path program 1 times [2024-11-10 00:47:42,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:42,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809970680] [2024-11-10 00:47:42,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:42,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:42,361 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:47:42,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:42,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809970680] [2024-11-10 00:47:42,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809970680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:42,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:42,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:47:42,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965772798] [2024-11-10 00:47:42,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:42,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:47:42,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:42,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:47:42,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:47:42,365 INFO L87 Difference]: Start difference. First operand 1563 states and 4243 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:47:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:42,478 INFO L93 Difference]: Finished difference Result 1761 states and 4543 transitions. [2024-11-10 00:47:42,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:47:42,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-10 00:47:42,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:42,485 INFO L225 Difference]: With dead ends: 1761 [2024-11-10 00:47:42,485 INFO L226 Difference]: Without dead ends: 1728 [2024-11-10 00:47:42,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:47:42,491 INFO L432 NwaCegarLoop]: 2189 mSDtfsCounter, 6651 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6651 SdHoareTripleChecker+Valid, 2577 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:42,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6651 Valid, 2577 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:47:42,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2024-11-10 00:47:42,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1593. [2024-11-10 00:47:42,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1591 states have (on average 2.6957888120678817) internal successors, (4289), 1592 states have internal predecessors, (4289), 0 states have call successors, (0), 0 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:47:42,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 4289 transitions. [2024-11-10 00:47:42,517 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 4289 transitions. Word has length 37 [2024-11-10 00:47:42,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:42,518 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 4289 transitions. [2024-11-10 00:47:42,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:47:42,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 4289 transitions. [2024-11-10 00:47:42,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 00:47:42,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:42,520 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] [2024-11-10 00:47:42,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:47:42,521 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:42,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:42,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1075758951, now seen corresponding path program 1 times [2024-11-10 00:47:42,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:42,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465569189] [2024-11-10 00:47:42,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:42,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:42,735 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:47:42,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:42,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465569189] [2024-11-10 00:47:42,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465569189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:42,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:42,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:47:42,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500812681] [2024-11-10 00:47:42,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:42,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:47:42,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:42,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:47:42,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:47:42,743 INFO L87 Difference]: Start difference. First operand 1593 states and 4289 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:47:42,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:42,850 INFO L93 Difference]: Finished difference Result 1659 states and 4387 transitions. [2024-11-10 00:47:42,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:47:42,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-10 00:47:42,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:42,860 INFO L225 Difference]: With dead ends: 1659 [2024-11-10 00:47:42,864 INFO L226 Difference]: Without dead ends: 1596 [2024-11-10 00:47:42,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:47:42,866 INFO L432 NwaCegarLoop]: 2188 mSDtfsCounter, 6469 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6469 SdHoareTripleChecker+Valid, 2280 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:42,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6469 Valid, 2280 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:42,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2024-11-10 00:47:42,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1593. [2024-11-10 00:47:42,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1591 states have (on average 2.6951602765556255) internal successors, (4288), 1592 states have internal predecessors, (4288), 0 states have call successors, (0), 0 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:47:42,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 4288 transitions. [2024-11-10 00:47:42,930 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 4288 transitions. Word has length 39 [2024-11-10 00:47:42,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:42,932 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 4288 transitions. [2024-11-10 00:47:42,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:47:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 4288 transitions. [2024-11-10 00:47:42,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 00:47:42,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:42,935 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] [2024-11-10 00:47:42,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:47:42,935 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:42,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:42,935 INFO L85 PathProgramCache]: Analyzing trace with hash 712608318, now seen corresponding path program 1 times [2024-11-10 00:47:42,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:42,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510789337] [2024-11-10 00:47:42,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:42,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:43,023 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:47:43,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:43,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510789337] [2024-11-10 00:47:43,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510789337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:43,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:43,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:43,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608922884] [2024-11-10 00:47:43,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:43,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:43,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:43,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:43,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:43,025 INFO L87 Difference]: Start difference. First operand 1593 states and 4288 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 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:47:43,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:43,058 INFO L93 Difference]: Finished difference Result 1707 states and 4458 transitions. [2024-11-10 00:47:43,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:43,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2024-11-10 00:47:43,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:43,064 INFO L225 Difference]: With dead ends: 1707 [2024-11-10 00:47:43,064 INFO L226 Difference]: Without dead ends: 1644 [2024-11-10 00:47:43,064 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:47:43,065 INFO L432 NwaCegarLoop]: 2199 mSDtfsCounter, 2150 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2150 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:43,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2150 Valid, 2244 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:43,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2024-11-10 00:47:43,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1641. [2024-11-10 00:47:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1639 states have (on average 2.6589383770591826) internal successors, (4358), 1640 states have internal predecessors, (4358), 0 states have call successors, (0), 0 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:47:43,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 4358 transitions. [2024-11-10 00:47:43,093 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 4358 transitions. Word has length 40 [2024-11-10 00:47:43,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:43,094 INFO L471 AbstractCegarLoop]: Abstraction has 1641 states and 4358 transitions. [2024-11-10 00:47:43,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 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:47:43,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 4358 transitions. [2024-11-10 00:47:43,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:47:43,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:43,094 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] [2024-11-10 00:47:43,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:47:43,095 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:43,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:43,095 INFO L85 PathProgramCache]: Analyzing trace with hash 55525097, now seen corresponding path program 1 times [2024-11-10 00:47:43,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:43,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342711031] [2024-11-10 00:47:43,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:43,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:43,133 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:47:43,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:43,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342711031] [2024-11-10 00:47:43,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342711031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:43,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:43,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:43,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199365833] [2024-11-10 00:47:43,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:43,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:43,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:43,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:43,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:43,135 INFO L87 Difference]: Start difference. First operand 1641 states and 4358 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:47:43,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:43,168 INFO L93 Difference]: Finished difference Result 1762 states and 4538 transitions. [2024-11-10 00:47:43,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:43,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-11-10 00:47:43,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:43,174 INFO L225 Difference]: With dead ends: 1762 [2024-11-10 00:47:43,174 INFO L226 Difference]: Without dead ends: 1699 [2024-11-10 00:47:43,175 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:47:43,176 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 2160 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 2278 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:47:43,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2160 Valid, 2278 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:43,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2024-11-10 00:47:43,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1696. [2024-11-10 00:47:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1694 states have (on average 2.6198347107438016) internal successors, (4438), 1695 states have internal predecessors, (4438), 0 states have call successors, (0), 0 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:47:43,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 4438 transitions. [2024-11-10 00:47:43,210 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 4438 transitions. Word has length 41 [2024-11-10 00:47:43,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:43,212 INFO L471 AbstractCegarLoop]: Abstraction has 1696 states and 4438 transitions. [2024-11-10 00:47:43,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:47:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 4438 transitions. [2024-11-10 00:47:43,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:47:43,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:43,213 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] [2024-11-10 00:47:43,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:47:43,213 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:43,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:43,214 INFO L85 PathProgramCache]: Analyzing trace with hash 41075241, now seen corresponding path program 1 times [2024-11-10 00:47:43,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:43,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755975667] [2024-11-10 00:47:43,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:43,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:43,257 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:47:43,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:43,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755975667] [2024-11-10 00:47:43,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755975667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:43,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:43,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:43,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373657167] [2024-11-10 00:47:43,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:43,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:43,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:43,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:43,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:43,259 INFO L87 Difference]: Start difference. First operand 1696 states and 4438 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:47:43,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:43,288 INFO L93 Difference]: Finished difference Result 1998 states and 4880 transitions. [2024-11-10 00:47:43,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:43,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-11-10 00:47:43,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:43,296 INFO L225 Difference]: With dead ends: 1998 [2024-11-10 00:47:43,296 INFO L226 Difference]: Without dead ends: 1835 [2024-11-10 00:47:43,297 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:47:43,298 INFO L432 NwaCegarLoop]: 2229 mSDtfsCounter, 2158 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2158 SdHoareTripleChecker+Valid, 2284 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:47:43,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2158 Valid, 2284 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:43,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2024-11-10 00:47:43,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1832. [2024-11-10 00:47:43,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1832 states, 1830 states have (on average 2.530054644808743) internal successors, (4630), 1831 states have internal predecessors, (4630), 0 states have call successors, (0), 0 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:47:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 4630 transitions. [2024-11-10 00:47:43,330 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 4630 transitions. Word has length 41 [2024-11-10 00:47:43,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:43,330 INFO L471 AbstractCegarLoop]: Abstraction has 1832 states and 4630 transitions. [2024-11-10 00:47:43,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:47:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 4630 transitions. [2024-11-10 00:47:43,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:47:43,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:43,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:47:43,332 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:43,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:43,332 INFO L85 PathProgramCache]: Analyzing trace with hash 2132677993, now seen corresponding path program 1 times [2024-11-10 00:47:43,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:43,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872517835] [2024-11-10 00:47:43,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:43,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:43,364 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:47:43,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:43,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872517835] [2024-11-10 00:47:43,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872517835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:43,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:43,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:43,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769257315] [2024-11-10 00:47:43,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:43,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:43,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:43,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:43,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:43,366 INFO L87 Difference]: Start difference. First operand 1832 states and 4630 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:47:43,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:43,397 INFO L93 Difference]: Finished difference Result 2382 states and 5414 transitions. [2024-11-10 00:47:43,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:43,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-11-10 00:47:43,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:43,405 INFO L225 Difference]: With dead ends: 2382 [2024-11-10 00:47:43,405 INFO L226 Difference]: Without dead ends: 2083 [2024-11-10 00:47:43,406 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:47:43,406 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 2156 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2156 SdHoareTripleChecker+Valid, 2286 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:47:43,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2156 Valid, 2286 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:43,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2024-11-10 00:47:43,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 2080. [2024-11-10 00:47:43,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2080 states, 2078 states have (on average 2.389797882579403) internal successors, (4966), 2079 states have internal predecessors, (4966), 0 states have call successors, (0), 0 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:47:43,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 2080 states and 4966 transitions. [2024-11-10 00:47:43,436 INFO L78 Accepts]: Start accepts. Automaton has 2080 states and 4966 transitions. Word has length 41 [2024-11-10 00:47:43,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:43,437 INFO L471 AbstractCegarLoop]: Abstraction has 2080 states and 4966 transitions. [2024-11-10 00:47:43,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:47:43,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2080 states and 4966 transitions. [2024-11-10 00:47:43,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:47:43,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:43,437 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] [2024-11-10 00:47:43,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:47:43,438 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:43,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:43,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1608400938, now seen corresponding path program 1 times [2024-11-10 00:47:43,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:43,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912417792] [2024-11-10 00:47:43,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:43,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:43,572 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:47:43,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:43,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912417792] [2024-11-10 00:47:43,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912417792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:43,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:43,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:47:43,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140813340] [2024-11-10 00:47:43,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:43,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:47:43,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:43,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:47:43,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:47:43,573 INFO L87 Difference]: Start difference. First operand 2080 states and 4966 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:47:43,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:43,698 INFO L93 Difference]: Finished difference Result 2131 states and 5032 transitions. [2024-11-10 00:47:43,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:47:43,699 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-11-10 00:47:43,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:43,707 INFO L225 Difference]: With dead ends: 2131 [2024-11-10 00:47:43,708 INFO L226 Difference]: Without dead ends: 2128 [2024-11-10 00:47:43,708 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:47:43,709 INFO L432 NwaCegarLoop]: 2187 mSDtfsCounter, 0 mSDsluCounter, 13106 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15293 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:43,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15293 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2024-11-10 00:47:43,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 2128. [2024-11-10 00:47:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2128 states, 2126 states have (on average 2.35653809971778) internal successors, (5010), 2127 states have internal predecessors, (5010), 0 states have call successors, (0), 0 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:47:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 5010 transitions. [2024-11-10 00:47:43,745 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 5010 transitions. Word has length 41 [2024-11-10 00:47:43,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:43,746 INFO L471 AbstractCegarLoop]: Abstraction has 2128 states and 5010 transitions. [2024-11-10 00:47:43,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:47:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 5010 transitions. [2024-11-10 00:47:43,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:47:43,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:43,747 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] [2024-11-10 00:47:43,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:47:43,747 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:43,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:43,748 INFO L85 PathProgramCache]: Analyzing trace with hash 18026415, now seen corresponding path program 1 times [2024-11-10 00:47:43,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:43,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344660469] [2024-11-10 00:47:43,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:43,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:47:43,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:43,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344660469] [2024-11-10 00:47:43,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344660469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:43,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:43,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:47:43,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16442021] [2024-11-10 00:47:43,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:43,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:47:43,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:43,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:47:43,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:47:43,847 INFO L87 Difference]: Start difference. First operand 2128 states and 5010 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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:47:43,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:43,928 INFO L93 Difference]: Finished difference Result 3896 states and 7422 transitions. [2024-11-10 00:47:43,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:47:43,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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 58 [2024-11-10 00:47:43,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:43,941 INFO L225 Difference]: With dead ends: 3896 [2024-11-10 00:47:43,941 INFO L226 Difference]: Without dead ends: 3461 [2024-11-10 00:47:43,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:47:43,942 INFO L432 NwaCegarLoop]: 2235 mSDtfsCounter, 4410 mSDsluCounter, 2320 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4410 SdHoareTripleChecker+Valid, 4555 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:43,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4410 Valid, 4555 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:43,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2024-11-10 00:47:44,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 2644. [2024-11-10 00:47:44,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2642 states have (on average 2.1597274791824375) internal successors, (5706), 2643 states have internal predecessors, (5706), 0 states have call successors, (0), 0 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:47:44,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 5706 transitions. [2024-11-10 00:47:44,034 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 5706 transitions. Word has length 58 [2024-11-10 00:47:44,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:44,035 INFO L471 AbstractCegarLoop]: Abstraction has 2644 states and 5706 transitions. [2024-11-10 00:47:44,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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:47:44,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 5706 transitions. [2024-11-10 00:47:44,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:47:44,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:44,035 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] [2024-11-10 00:47:44,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:47:44,036 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:44,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:44,036 INFO L85 PathProgramCache]: Analyzing trace with hash 3576559, now seen corresponding path program 1 times [2024-11-10 00:47:44,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:44,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158877388] [2024-11-10 00:47:44,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:44,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:47:44,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:44,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158877388] [2024-11-10 00:47:44,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158877388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:44,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:44,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:47:44,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849394046] [2024-11-10 00:47:44,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:44,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:47:44,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:44,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:47:44,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:47:44,127 INFO L87 Difference]: Start difference. First operand 2644 states and 5706 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:47:44,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:44,209 INFO L93 Difference]: Finished difference Result 4488 states and 8226 transitions. [2024-11-10 00:47:44,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:47:44,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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:47:44,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:44,215 INFO L225 Difference]: With dead ends: 4488 [2024-11-10 00:47:44,215 INFO L226 Difference]: Without dead ends: 3893 [2024-11-10 00:47:44,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:47:44,217 INFO L432 NwaCegarLoop]: 2236 mSDtfsCounter, 4412 mSDsluCounter, 2303 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4412 SdHoareTripleChecker+Valid, 4539 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:44,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4412 Valid, 4539 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:44,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3893 states. [2024-11-10 00:47:44,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3893 to 3452. [2024-11-10 00:47:44,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 3450 states have (on average 1.9692753623188406) internal successors, (6794), 3451 states have internal predecessors, (6794), 0 states have call successors, (0), 0 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:47:44,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 6794 transitions. [2024-11-10 00:47:44,289 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 6794 transitions. Word has length 58 [2024-11-10 00:47:44,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:44,290 INFO L471 AbstractCegarLoop]: Abstraction has 3452 states and 6794 transitions. [2024-11-10 00:47:44,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:47:44,291 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 6794 transitions. [2024-11-10 00:47:44,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:47:44,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:44,292 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] [2024-11-10 00:47:44,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:47:44,292 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:44,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:44,293 INFO L85 PathProgramCache]: Analyzing trace with hash 2095179311, now seen corresponding path program 1 times [2024-11-10 00:47:44,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:44,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676000767] [2024-11-10 00:47:44,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:44,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:47:44,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:44,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676000767] [2024-11-10 00:47:44,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676000767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:44,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:44,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:47:44,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552881878] [2024-11-10 00:47:44,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:44,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:47:44,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:44,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:47:44,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:47:44,368 INFO L87 Difference]: Start difference. First operand 3452 states and 6794 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:44,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:44,460 INFO L93 Difference]: Finished difference Result 5080 states and 9026 transitions. [2024-11-10 00:47:44,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:47:44,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-10 00:47:44,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:44,468 INFO L225 Difference]: With dead ends: 5080 [2024-11-10 00:47:44,468 INFO L226 Difference]: Without dead ends: 4485 [2024-11-10 00:47:44,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:47:44,470 INFO L432 NwaCegarLoop]: 2237 mSDtfsCounter, 4421 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4421 SdHoareTripleChecker+Valid, 4538 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:44,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4421 Valid, 4538 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:44,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4485 states. [2024-11-10 00:47:44,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4485 to 4044. [2024-11-10 00:47:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4044 states, 4042 states have (on average 1.8787728847105394) internal successors, (7594), 4043 states have internal predecessors, (7594), 0 states have call successors, (0), 0 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:47:44,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4044 states to 4044 states and 7594 transitions. [2024-11-10 00:47:44,536 INFO L78 Accepts]: Start accepts. Automaton has 4044 states and 7594 transitions. Word has length 58 [2024-11-10 00:47:44,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:44,536 INFO L471 AbstractCegarLoop]: Abstraction has 4044 states and 7594 transitions. [2024-11-10 00:47:44,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:44,537 INFO L276 IsEmpty]: Start isEmpty. Operand 4044 states and 7594 transitions. [2024-11-10 00:47:44,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:47:44,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:44,538 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] [2024-11-10 00:47:44,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:47:44,538 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:44,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:44,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1862091119, now seen corresponding path program 1 times [2024-11-10 00:47:44,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:44,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650797773] [2024-11-10 00:47:44,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:44,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:44,598 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:44,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:44,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650797773] [2024-11-10 00:47:44,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650797773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:44,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:44,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:44,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886401541] [2024-11-10 00:47:44,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:44,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:44,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:44,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:44,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:44,600 INFO L87 Difference]: Start difference. First operand 4044 states and 7594 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:47:44,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:44,735 INFO L93 Difference]: Finished difference Result 6558 states and 10994 transitions. [2024-11-10 00:47:44,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:44,736 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:47:44,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:44,743 INFO L225 Difference]: With dead ends: 6558 [2024-11-10 00:47:44,743 INFO L226 Difference]: Without dead ends: 4047 [2024-11-10 00:47:44,746 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:47:44,747 INFO L432 NwaCegarLoop]: 2213 mSDtfsCounter, 28 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 4394 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:47:44,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 4394 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:44,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4047 states. [2024-11-10 00:47:44,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4047 to 4044. [2024-11-10 00:47:44,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4044 states, 4042 states have (on average 1.8664027709054922) internal successors, (7544), 4043 states have internal predecessors, (7544), 0 states have call successors, (0), 0 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:47:44,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4044 states to 4044 states and 7544 transitions. [2024-11-10 00:47:44,846 INFO L78 Accepts]: Start accepts. Automaton has 4044 states and 7544 transitions. Word has length 60 [2024-11-10 00:47:44,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:44,847 INFO L471 AbstractCegarLoop]: Abstraction has 4044 states and 7544 transitions. [2024-11-10 00:47:44,847 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:47:44,847 INFO L276 IsEmpty]: Start isEmpty. Operand 4044 states and 7544 transitions. [2024-11-10 00:47:44,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:47:44,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:44,849 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] [2024-11-10 00:47:44,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:47:44,849 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:44,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:44,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1431466449, now seen corresponding path program 1 times [2024-11-10 00:47:44,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:44,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99376700] [2024-11-10 00:47:44,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:44,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:44,927 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:44,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:44,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99376700] [2024-11-10 00:47:44,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99376700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:44,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:44,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:44,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458479231] [2024-11-10 00:47:44,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:44,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:44,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:44,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:44,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:44,930 INFO L87 Difference]: Start difference. First operand 4044 states and 7544 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:47:44,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:44,982 INFO L93 Difference]: Finished difference Result 5039 states and 8880 transitions. [2024-11-10 00:47:44,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:44,983 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:47:44,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:44,988 INFO L225 Difference]: With dead ends: 5039 [2024-11-10 00:47:44,988 INFO L226 Difference]: Without dead ends: 2528 [2024-11-10 00:47:44,991 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:47:44,991 INFO L432 NwaCegarLoop]: 2211 mSDtfsCounter, 24 mSDsluCounter, 2180 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 4391 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:47:44,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 4391 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:44,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2024-11-10 00:47:45,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2518. [2024-11-10 00:47:45,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2516 states have (on average 2.1875993640699525) internal successors, (5504), 2517 states have internal predecessors, (5504), 0 states have call successors, (0), 0 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:47:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 5504 transitions. [2024-11-10 00:47:45,042 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 5504 transitions. Word has length 60 [2024-11-10 00:47:45,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:45,042 INFO L471 AbstractCegarLoop]: Abstraction has 2518 states and 5504 transitions. [2024-11-10 00:47:45,042 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:47:45,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 5504 transitions. [2024-11-10 00:47:45,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 00:47:45,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:45,044 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:45,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:47:45,044 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:45,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:45,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1439328557, now seen corresponding path program 1 times [2024-11-10 00:47:45,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:45,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504443184] [2024-11-10 00:47:45,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:45,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:45,115 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:45,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:45,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504443184] [2024-11-10 00:47:45,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504443184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:45,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:45,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:45,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106245938] [2024-11-10 00:47:45,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:45,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:45,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:45,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:45,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:45,117 INFO L87 Difference]: Start difference. First operand 2518 states and 5504 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:47:45,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:45,153 INFO L93 Difference]: Finished difference Result 3010 states and 6156 transitions. [2024-11-10 00:47:45,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:45,154 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:47:45,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:45,158 INFO L225 Difference]: With dead ends: 3010 [2024-11-10 00:47:45,158 INFO L226 Difference]: Without dead ends: 2035 [2024-11-10 00:47:45,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:47:45,160 INFO L432 NwaCegarLoop]: 2205 mSDtfsCounter, 22 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4370 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:47:45,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 4370 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:45,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2024-11-10 00:47:45,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 2032. [2024-11-10 00:47:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2032 states, 2030 states have (on average 2.3876847290640395) internal successors, (4847), 2031 states have internal predecessors, (4847), 0 states have call successors, (0), 0 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:47:45,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 4847 transitions. [2024-11-10 00:47:45,197 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 4847 transitions. Word has length 62 [2024-11-10 00:47:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:45,197 INFO L471 AbstractCegarLoop]: Abstraction has 2032 states and 4847 transitions. [2024-11-10 00:47:45,197 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:47:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 4847 transitions. [2024-11-10 00:47:45,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 00:47:45,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:45,198 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:45,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:47:45,199 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:45,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:45,199 INFO L85 PathProgramCache]: Analyzing trace with hash 111390330, now seen corresponding path program 1 times [2024-11-10 00:47:45,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:45,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674791933] [2024-11-10 00:47:45,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:45,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:45,552 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:45,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:45,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674791933] [2024-11-10 00:47:45,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674791933] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:47:45,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204287403] [2024-11-10 00:47:45,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:45,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:45,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:47:45,556 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:47:45,560 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:47:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:45,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 00:47:45,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:47:46,306 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:46,307 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:47:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:47,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204287403] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:47:47,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:47:47,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2024-11-10 00:47:47,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930535640] [2024-11-10 00:47:47,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:47:47,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 00:47:47,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:47,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 00:47:47,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2024-11-10 00:47:47,172 INFO L87 Difference]: Start difference. First operand 2032 states and 4847 transitions. Second operand has 30 states, 30 states have (on average 5.666666666666667) internal successors, (170), 30 states have internal predecessors, (170), 0 states have call successors, (0), 0 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:47:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:48,870 INFO L93 Difference]: Finished difference Result 3478 states and 6742 transitions. [2024-11-10 00:47:48,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-10 00:47:48,870 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.666666666666667) internal successors, (170), 30 states have internal predecessors, (170), 0 states have call successors, (0), 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 64 [2024-11-10 00:47:48,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:48,875 INFO L225 Difference]: With dead ends: 3478 [2024-11-10 00:47:48,875 INFO L226 Difference]: Without dead ends: 2989 [2024-11-10 00:47:48,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=650, Invalid=2656, Unknown=0, NotChecked=0, Total=3306 [2024-11-10 00:47:48,877 INFO L432 NwaCegarLoop]: 2167 mSDtfsCounter, 22988 mSDsluCounter, 24033 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22988 SdHoareTripleChecker+Valid, 26200 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:48,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22988 Valid, 26200 Invalid, 715 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [42 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 00:47:48,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2024-11-10 00:47:48,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 2974. [2024-11-10 00:47:48,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2974 states, 2972 states have (on average 2.031628532974428) internal successors, (6038), 2973 states have internal predecessors, (6038), 0 states have call successors, (0), 0 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:47:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 6038 transitions. [2024-11-10 00:47:48,924 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 6038 transitions. Word has length 64 [2024-11-10 00:47:48,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:48,924 INFO L471 AbstractCegarLoop]: Abstraction has 2974 states and 6038 transitions. [2024-11-10 00:47:48,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.666666666666667) internal successors, (170), 30 states have internal predecessors, (170), 0 states have call successors, (0), 0 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:47:48,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 6038 transitions. [2024-11-10 00:47:48,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 00:47:48,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:48,925 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:48,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 00:47:49,129 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,SelfDestructingSolverStorable16 [2024-11-10 00:47:49,130 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:49,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:49,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1924712451, now seen corresponding path program 1 times [2024-11-10 00:47:49,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:49,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877731765] [2024-11-10 00:47:49,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:49,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:49,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:49,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877731765] [2024-11-10 00:47:49,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877731765] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:47:49,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832421402] [2024-11-10 00:47:49,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:49,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:49,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:47:49,843 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:47:49,844 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:47:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:49,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 00:47:49,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:47:51,166 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:51,166 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:47:53,864 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:53,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832421402] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:47:53,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:47:53,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 18] total 42 [2024-11-10 00:47:53,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703953420] [2024-11-10 00:47:53,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:47:53,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-10 00:47:53,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:53,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-10 00:47:53,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1457, Unknown=0, NotChecked=0, Total=1722 [2024-11-10 00:47:53,867 INFO L87 Difference]: Start difference. First operand 2974 states and 6038 transitions. Second operand has 42 states, 42 states have (on average 3.8095238095238093) internal successors, (160), 42 states have internal predecessors, (160), 0 states have call successors, (0), 0 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:47:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:57,182 INFO L93 Difference]: Finished difference Result 7651 states and 11995 transitions. [2024-11-10 00:47:57,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-10 00:47:57,183 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.8095238095238093) internal successors, (160), 42 states have internal predecessors, (160), 0 states have call successors, (0), 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:47:57,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:57,190 INFO L225 Difference]: With dead ends: 7651 [2024-11-10 00:47:57,191 INFO L226 Difference]: Without dead ends: 6220 [2024-11-10 00:47:57,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1390, Invalid=4616, Unknown=0, NotChecked=0, Total=6006 [2024-11-10 00:47:57,195 INFO L432 NwaCegarLoop]: 2191 mSDtfsCounter, 16611 mSDsluCounter, 20109 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16611 SdHoareTripleChecker+Valid, 22300 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:57,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16611 Valid, 22300 Invalid, 1183 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [68 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 00:47:57,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6220 states. [2024-11-10 00:47:57,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6220 to 3938. [2024-11-10 00:47:57,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3938 states, 3936 states have (on average 1.8434959349593496) internal successors, (7256), 3937 states have internal predecessors, (7256), 0 states have call successors, (0), 0 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:47:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3938 states to 3938 states and 7256 transitions. [2024-11-10 00:47:57,295 INFO L78 Accepts]: Start accepts. Automaton has 3938 states and 7256 transitions. Word has length 65 [2024-11-10 00:47:57,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:57,295 INFO L471 AbstractCegarLoop]: Abstraction has 3938 states and 7256 transitions. [2024-11-10 00:47:57,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.8095238095238093) internal successors, (160), 42 states have internal predecessors, (160), 0 states have call successors, (0), 0 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:47:57,296 INFO L276 IsEmpty]: Start isEmpty. Operand 3938 states and 7256 transitions. [2024-11-10 00:47:57,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 00:47:57,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:57,296 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] [2024-11-10 00:47:57,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 00:47:57,498 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,SelfDestructingSolverStorable17 [2024-11-10 00:47:57,499 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:57,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:57,500 INFO L85 PathProgramCache]: Analyzing trace with hash -136318182, now seen corresponding path program 1 times [2024-11-10 00:47:57,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:57,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255628362] [2024-11-10 00:47:57,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:57,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:58,153 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:58,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:58,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255628362] [2024-11-10 00:47:58,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255628362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:47:58,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027715324] [2024-11-10 00:47:58,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:58,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:58,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:47:58,155 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:47:58,157 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:47:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:58,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 00:47:58,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:47:58,983 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:58,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:47:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:59,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027715324] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:47:59,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:47:59,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 40 [2024-11-10 00:47:59,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028117489] [2024-11-10 00:47:59,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:47:59,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-10 00:47:59,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:59,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-10 00:47:59,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2024-11-10 00:47:59,786 INFO L87 Difference]: Start difference. First operand 3938 states and 7256 transitions. Second operand has 40 states, 40 states have (on average 4.25) internal successors, (170), 40 states have internal predecessors, (170), 0 states have call successors, (0), 0 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:48:03,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:03,452 INFO L93 Difference]: Finished difference Result 15375 states and 21849 transitions. [2024-11-10 00:48:03,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-10 00:48:03,453 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 4.25) internal successors, (170), 40 states have internal predecessors, (170), 0 states have call successors, (0), 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 66 [2024-11-10 00:48:03,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:03,484 INFO L225 Difference]: With dead ends: 15375 [2024-11-10 00:48:03,484 INFO L226 Difference]: Without dead ends: 14116 [2024-11-10 00:48:03,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1379, Invalid=5101, Unknown=0, NotChecked=0, Total=6480 [2024-11-10 00:48:03,492 INFO L432 NwaCegarLoop]: 2212 mSDtfsCounter, 23826 mSDsluCounter, 20281 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23826 SdHoareTripleChecker+Valid, 22493 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:03,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23826 Valid, 22493 Invalid, 1465 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [51 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 00:48:03,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14116 states. [2024-11-10 00:48:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14116 to 4826. [2024-11-10 00:48:03,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4826 states, 4824 states have (on average 1.732379767827529) internal successors, (8357), 4825 states have internal predecessors, (8357), 0 states have call successors, (0), 0 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:48:03,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4826 states to 4826 states and 8357 transitions. [2024-11-10 00:48:03,772 INFO L78 Accepts]: Start accepts. Automaton has 4826 states and 8357 transitions. Word has length 66 [2024-11-10 00:48:03,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:03,772 INFO L471 AbstractCegarLoop]: Abstraction has 4826 states and 8357 transitions. [2024-11-10 00:48:03,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.25) internal successors, (170), 40 states have internal predecessors, (170), 0 states have call successors, (0), 0 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:48:03,773 INFO L276 IsEmpty]: Start isEmpty. Operand 4826 states and 8357 transitions. [2024-11-10 00:48:03,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:48:03,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:03,776 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] [2024-11-10 00:48:03,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 00:48:03,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:48:03,980 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:03,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:03,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1274102374, now seen corresponding path program 1 times [2024-11-10 00:48:03,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:03,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217413152] [2024-11-10 00:48:03,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:03,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:04,121 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:48:04,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:04,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217413152] [2024-11-10 00:48:04,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217413152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:48:04,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635078659] [2024-11-10 00:48:04,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:04,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:48:04,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:48:04,123 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:48:04,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 00:48:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:04,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 00:48:04,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:48:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:48:04,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:48:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:48:04,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635078659] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:48:04,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:48:04,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2024-11-10 00:48:04,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289467641] [2024-11-10 00:48:04,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:48:04,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:48:04,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:04,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:48:04,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:48:04,481 INFO L87 Difference]: Start difference. First operand 4826 states and 8357 transitions. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:04,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:04,708 INFO L93 Difference]: Finished difference Result 10068 states and 14801 transitions. [2024-11-10 00:48:04,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:48:04,709 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 00:48:04,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:04,715 INFO L225 Difference]: With dead ends: 10068 [2024-11-10 00:48:04,716 INFO L226 Difference]: Without dead ends: 6785 [2024-11-10 00:48:04,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:48:04,719 INFO L432 NwaCegarLoop]: 2188 mSDtfsCounter, 6447 mSDsluCounter, 4532 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6447 SdHoareTripleChecker+Valid, 6720 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:04,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6447 Valid, 6720 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:04,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6785 states. [2024-11-10 00:48:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6785 to 6420. [2024-11-10 00:48:04,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6420 states, 6418 states have (on average 1.5704269242754751) internal successors, (10079), 6419 states have internal predecessors, (10079), 0 states have call successors, (0), 0 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:48:04,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6420 states to 6420 states and 10079 transitions. [2024-11-10 00:48:04,894 INFO L78 Accepts]: Start accepts. Automaton has 6420 states and 10079 transitions. Word has length 67 [2024-11-10 00:48:04,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:04,894 INFO L471 AbstractCegarLoop]: Abstraction has 6420 states and 10079 transitions. [2024-11-10 00:48:04,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:04,895 INFO L276 IsEmpty]: Start isEmpty. Operand 6420 states and 10079 transitions. [2024-11-10 00:48:04,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 00:48:04,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:04,896 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-10 00:48:04,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 00:48:05,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:48:05,097 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:05,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:05,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1894086119, now seen corresponding path program 1 times [2024-11-10 00:48:05,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:05,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690554484] [2024-11-10 00:48:05,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:05,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:05,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:05,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690554484] [2024-11-10 00:48:05,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690554484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:05,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:05,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:48:05,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548230211] [2024-11-10 00:48:05,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:05,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:48:05,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:05,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:48:05,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:05,204 INFO L87 Difference]: Start difference. First operand 6420 states and 10079 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:48:09,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:09,597 INFO L93 Difference]: Finished difference Result 9431 states and 18415 transitions. [2024-11-10 00:48:09,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:48:09,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-11-10 00:48:09,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:09,604 INFO L225 Difference]: With dead ends: 9431 [2024-11-10 00:48:09,604 INFO L226 Difference]: Without dead ends: 7924 [2024-11-10 00:48:09,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:09,607 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 1485 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3621 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 4273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 3621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:09,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 551 Invalid, 4273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 3621 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-10 00:48:09,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7924 states. [2024-11-10 00:48:09,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7924 to 7924. [2024-11-10 00:48:09,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7924 states, 7922 states have (on average 1.6883362787174956) internal successors, (13375), 7923 states have internal predecessors, (13375), 0 states have call successors, (0), 0 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:48:09,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7924 states to 7924 states and 13375 transitions. [2024-11-10 00:48:09,781 INFO L78 Accepts]: Start accepts. Automaton has 7924 states and 13375 transitions. Word has length 98 [2024-11-10 00:48:09,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:09,781 INFO L471 AbstractCegarLoop]: Abstraction has 7924 states and 13375 transitions. [2024-11-10 00:48:09,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:48:09,782 INFO L276 IsEmpty]: Start isEmpty. Operand 7924 states and 13375 transitions. [2024-11-10 00:48:09,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-10 00:48:09,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:09,785 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-10 00:48:09,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:48:09,785 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:09,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:09,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1418192942, now seen corresponding path program 1 times [2024-11-10 00:48:09,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:09,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65894133] [2024-11-10 00:48:09,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:09,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 25 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:10,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:10,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65894133] [2024-11-10 00:48:10,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65894133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:48:10,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526895448] [2024-11-10 00:48:10,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:10,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:48:10,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:48:10,456 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:48:10,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 00:48:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:10,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-10 00:48:10,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:48:13,003 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 33 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:13,004 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:48:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:21,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526895448] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:48:21,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:48:21,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 25, 30] total 63 [2024-11-10 00:48:21,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083457922] [2024-11-10 00:48:21,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:48:21,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-11-10 00:48:21,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:21,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-11-10 00:48:21,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=3335, Unknown=0, NotChecked=0, Total=3906 [2024-11-10 00:48:21,341 INFO L87 Difference]: Start difference. First operand 7924 states and 13375 transitions. Second operand has 63 states, 63 states have (on average 4.650793650793651) internal successors, (293), 63 states have internal predecessors, (293), 0 states have call successors, (0), 0 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:48:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:27,378 INFO L93 Difference]: Finished difference Result 11607 states and 17850 transitions. [2024-11-10 00:48:27,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-11-10 00:48:27,380 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 4.650793650793651) internal successors, (293), 63 states have internal predecessors, (293), 0 states have call successors, (0), 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 107 [2024-11-10 00:48:27,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:27,388 INFO L225 Difference]: With dead ends: 11607 [2024-11-10 00:48:27,388 INFO L226 Difference]: Without dead ends: 8417 [2024-11-10 00:48:27,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4535 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=2864, Invalid=13648, Unknown=0, NotChecked=0, Total=16512 [2024-11-10 00:48:27,402 INFO L432 NwaCegarLoop]: 2242 mSDtfsCounter, 31625 mSDsluCounter, 31209 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31625 SdHoareTripleChecker+Valid, 33451 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:27,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31625 Valid, 33451 Invalid, 1439 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [129 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 00:48:27,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8417 states. [2024-11-10 00:48:27,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8417 to 8085. [2024-11-10 00:48:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8085 states, 8083 states have (on average 1.6705431151800074) internal successors, (13503), 8084 states have internal predecessors, (13503), 0 states have call successors, (0), 0 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:48:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8085 states to 8085 states and 13503 transitions. [2024-11-10 00:48:27,827 INFO L78 Accepts]: Start accepts. Automaton has 8085 states and 13503 transitions. Word has length 107 [2024-11-10 00:48:27,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:27,827 INFO L471 AbstractCegarLoop]: Abstraction has 8085 states and 13503 transitions. [2024-11-10 00:48:27,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 4.650793650793651) internal successors, (293), 63 states have internal predecessors, (293), 0 states have call successors, (0), 0 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:48:27,827 INFO L276 IsEmpty]: Start isEmpty. Operand 8085 states and 13503 transitions. [2024-11-10 00:48:27,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 00:48:27,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:27,829 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:27,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 00:48:28,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-10 00:48:28,034 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:28,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:28,034 INFO L85 PathProgramCache]: Analyzing trace with hash 122124328, now seen corresponding path program 1 times [2024-11-10 00:48:28,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:28,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969520507] [2024-11-10 00:48:28,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:28,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:28,397 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 35 proven. 53 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 00:48:28,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:28,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969520507] [2024-11-10 00:48:28,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969520507] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:48:28,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351945500] [2024-11-10 00:48:28,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:28,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:48:28,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:48:28,399 INFO L229 MonitoredProcess]: Starting monitored process 7 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:48:28,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 00:48:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:28,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 00:48:28,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:48:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 39 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:29,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:48:30,507 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:30,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351945500] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:48:30,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:48:30,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 26 [2024-11-10 00:48:30,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623157613] [2024-11-10 00:48:30,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:48:30,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 00:48:30,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:30,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 00:48:30,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2024-11-10 00:48:30,512 INFO L87 Difference]: Start difference. First operand 8085 states and 13503 transitions. Second operand has 27 states, 27 states have (on average 9.185185185185185) internal successors, (248), 26 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:32,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:32,277 INFO L93 Difference]: Finished difference Result 17914 states and 25281 transitions. [2024-11-10 00:48:32,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-10 00:48:32,278 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 9.185185185185185) internal successors, (248), 26 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-10 00:48:32,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:32,292 INFO L225 Difference]: With dead ends: 17914 [2024-11-10 00:48:32,292 INFO L226 Difference]: Without dead ends: 14273 [2024-11-10 00:48:32,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=865, Invalid=2795, Unknown=0, NotChecked=0, Total=3660 [2024-11-10 00:48:32,300 INFO L432 NwaCegarLoop]: 2216 mSDtfsCounter, 26771 mSDsluCounter, 17908 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26771 SdHoareTripleChecker+Valid, 20124 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:32,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26771 Valid, 20124 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:48:32,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14273 states. [2024-11-10 00:48:32,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14273 to 10406. [2024-11-10 00:48:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10406 states, 10404 states have (on average 1.5636293733179547) internal successors, (16268), 10405 states have internal predecessors, (16268), 0 states have call successors, (0), 0 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:48:32,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10406 states to 10406 states and 16268 transitions. [2024-11-10 00:48:32,648 INFO L78 Accepts]: Start accepts. Automaton has 10406 states and 16268 transitions. Word has length 108 [2024-11-10 00:48:32,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:32,649 INFO L471 AbstractCegarLoop]: Abstraction has 10406 states and 16268 transitions. [2024-11-10 00:48:32,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.185185185185185) internal successors, (248), 26 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 10406 states and 16268 transitions. [2024-11-10 00:48:32,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 00:48:32,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:32,652 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-10 00:48:32,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 00:48:32,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:48:32,853 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:32,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:32,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1680227606, now seen corresponding path program 1 times [2024-11-10 00:48:32,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:32,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677805692] [2024-11-10 00:48:32,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:32,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:33,429 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 25 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:33,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:33,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677805692] [2024-11-10 00:48:33,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677805692] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:48:33,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419753486] [2024-11-10 00:48:33,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:33,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:48:33,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:48:33,432 INFO L229 MonitoredProcess]: Starting monitored process 8 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:48:33,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 00:48:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:33,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 00:48:33,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:48:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 25 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:35,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:48:38,718 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 25 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:38,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419753486] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:48:38,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:48:38,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 53 [2024-11-10 00:48:38,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314736059] [2024-11-10 00:48:38,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:48:38,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-10 00:48:38,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:38,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-10 00:48:38,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=2473, Unknown=0, NotChecked=0, Total=2756 [2024-11-10 00:48:38,721 INFO L87 Difference]: Start difference. First operand 10406 states and 16268 transitions. Second operand has 53 states, 53 states have (on average 5.566037735849057) internal successors, (295), 53 states have internal predecessors, (295), 0 states have call successors, (0), 0 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:48:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:44,069 INFO L93 Difference]: Finished difference Result 16710 states and 23840 transitions. [2024-11-10 00:48:44,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-10 00:48:44,070 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 5.566037735849057) internal successors, (295), 53 states have internal predecessors, (295), 0 states have call successors, (0), 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 108 [2024-11-10 00:48:44,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:44,081 INFO L225 Difference]: With dead ends: 16710 [2024-11-10 00:48:44,081 INFO L226 Difference]: Without dead ends: 13047 [2024-11-10 00:48:44,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2229 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1620, Invalid=7500, Unknown=0, NotChecked=0, Total=9120 [2024-11-10 00:48:44,086 INFO L432 NwaCegarLoop]: 2275 mSDtfsCounter, 25689 mSDsluCounter, 53429 mSDsCounter, 0 mSdLazyCounter, 1875 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25689 SdHoareTripleChecker+Valid, 55704 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:44,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25689 Valid, 55704 Invalid, 1973 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [98 Valid, 1875 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 00:48:44,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13047 states. [2024-11-10 00:48:44,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13047 to 12873. [2024-11-10 00:48:44,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12873 states, 12871 states have (on average 1.488617823012975) internal successors, (19160), 12872 states have internal predecessors, (19160), 0 states have call successors, (0), 0 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:48:44,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12873 states to 12873 states and 19160 transitions. [2024-11-10 00:48:44,626 INFO L78 Accepts]: Start accepts. Automaton has 12873 states and 19160 transitions. Word has length 108 [2024-11-10 00:48:44,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:44,627 INFO L471 AbstractCegarLoop]: Abstraction has 12873 states and 19160 transitions. [2024-11-10 00:48:44,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 5.566037735849057) internal successors, (295), 53 states have internal predecessors, (295), 0 states have call successors, (0), 0 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:48:44,627 INFO L276 IsEmpty]: Start isEmpty. Operand 12873 states and 19160 transitions. [2024-11-10 00:48:44,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-10 00:48:44,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:44,629 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2024-11-10 00:48:44,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 00:48:44,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:48:44,834 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:44,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:44,834 INFO L85 PathProgramCache]: Analyzing trace with hash 41264274, now seen corresponding path program 1 times [2024-11-10 00:48:44,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:44,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863984371] [2024-11-10 00:48:44,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:44,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:46,098 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-10 00:48:46,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:46,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863984371] [2024-11-10 00:48:46,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863984371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:48:46,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608419865] [2024-11-10 00:48:46,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:46,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:48:46,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:48:46,100 INFO L229 MonitoredProcess]: Starting monitored process 9 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:48:46,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 00:48:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:46,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-10 00:48:46,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:48:48,536 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 40 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:48,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:48:51,040 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 40 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:51,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608419865] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:48:51,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:48:51,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 59 [2024-11-10 00:48:51,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291600796] [2024-11-10 00:48:51,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:48:51,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-10 00:48:51,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:51,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-10 00:48:51,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=3119, Unknown=0, NotChecked=0, Total=3422 [2024-11-10 00:48:51,043 INFO L87 Difference]: Start difference. First operand 12873 states and 19160 transitions. Second operand has 59 states, 59 states have (on average 4.491525423728813) internal successors, (265), 59 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)