./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label00.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.8.ufo.UNBOUNDED.pals+Problem12_label00.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 5f06498eb80e802eba7f35e8b89bda4b42e6ab2a6a5c4854a4d889d75d8cafdd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:04:12,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:04:12,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 01:04:12,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:04:12,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:04:12,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:04:12,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:04:12,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:04:12,790 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:04:12,791 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:04:12,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:04:12,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:04:12,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:04:12,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:04:12,795 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:04:12,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:04:12,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:04:12,796 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 01:04:12,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:04:12,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 01:04:12,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:04:12,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:04:12,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:04:12,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:04:12,802 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:04:12,802 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 01:04:12,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:04:12,803 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:04:12,803 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:04:12,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:04:12,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:04:12,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:04:12,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:04:12,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:04:12,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:04:12,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:04:12,805 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:04:12,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:04:12,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:04:12,807 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:04:12,807 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:04:12,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:04:12,808 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 -> 5f06498eb80e802eba7f35e8b89bda4b42e6ab2a6a5c4854a4d889d75d8cafdd [2024-11-10 01:04:13,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:04:13,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:04:13,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:04:13,096 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:04:13,097 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:04:13,098 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label00.c [2024-11-10 01:04:14,610 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:04:15,112 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:04:15,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label00.c [2024-11-10 01:04:15,160 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/052b0205a/fa8e712d6ffe4aed99866aa9074f0f87/FLAGe21348872 [2024-11-10 01:04:15,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/052b0205a/fa8e712d6ffe4aed99866aa9074f0f87 [2024-11-10 01:04:15,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:04:15,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:04:15,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:04:15,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:04:15,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:04:15,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:04:15" (1/1) ... [2024-11-10 01:04:15,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5400783c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:15, skipping insertion in model container [2024-11-10 01:04:15,193 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:04:15" (1/1) ... [2024-11-10 01:04:15,306 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:04:15,729 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.8.ufo.UNBOUNDED.pals+Problem12_label00.c[26888,26901] [2024-11-10 01:04:15,767 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.8.ufo.UNBOUNDED.pals+Problem12_label00.c[28763,28776] [2024-11-10 01:04:16,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:04:16,445 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:04:16,504 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.8.ufo.UNBOUNDED.pals+Problem12_label00.c[26888,26901] [2024-11-10 01:04:16,508 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.8.ufo.UNBOUNDED.pals+Problem12_label00.c[28763,28776] [2024-11-10 01:04:17,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:04:17,039 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:04:17,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:17 WrapperNode [2024-11-10 01:04:17,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:04:17,041 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:04:17,041 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:04:17,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:04:17,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:17" (1/1) ... [2024-11-10 01:04:17,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:17" (1/1) ... [2024-11-10 01:04:17,428 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5289 [2024-11-10 01:04:17,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:04:17,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:04:17,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:04:17,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:04:17,441 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:17" (1/1) ... [2024-11-10 01:04:17,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:17" (1/1) ... [2024-11-10 01:04:17,508 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:17" (1/1) ... [2024-11-10 01:04:17,747 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 01:04:17,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:17" (1/1) ... [2024-11-10 01:04:17,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:17" (1/1) ... [2024-11-10 01:04:17,879 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:17" (1/1) ... [2024-11-10 01:04:17,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:17" (1/1) ... [2024-11-10 01:04:17,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:17" (1/1) ... [2024-11-10 01:04:17,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:17" (1/1) ... [2024-11-10 01:04:18,005 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:04:18,007 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:04:18,007 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:04:18,007 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:04:18,008 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:17" (1/1) ... [2024-11-10 01:04:18,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:04:18,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:04:18,040 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 01:04:18,043 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 01:04:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:04:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:04:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:04:18,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:04:18,227 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:04:18,229 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:04:23,544 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375: havoc calculate_output_#t~ret49#1; [2024-11-10 01:04:23,545 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3854: havoc calculate_output2_#t~ret50#1; [2024-11-10 01:04:23,545 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5344: havoc calculate_output3_#t~ret51#1; [2024-11-10 01:04:23,968 INFO L? ?]: Removed 2096 outVars from TransFormulas that were not future-live. [2024-11-10 01:04:23,969 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:04:24,091 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:04:24,093 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:04:24,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:04:24 BoogieIcfgContainer [2024-11-10 01:04:24,094 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:04:24,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:04:24,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:04:24,101 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:04:24,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:04:15" (1/3) ... [2024-11-10 01:04:24,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd28ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:04:24, skipping insertion in model container [2024-11-10 01:04:24,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:17" (2/3) ... [2024-11-10 01:04:24,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd28ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:04:24, skipping insertion in model container [2024-11-10 01:04:24,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:04:24" (3/3) ... [2024-11-10 01:04:24,105 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label00.c [2024-11-10 01:04:24,121 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:04:24,122 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 01:04:24,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:04:24,240 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;@3028d50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:04:24,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 01:04:24,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 956 states, 953 states have (on average 2.6096537250786986) internal successors, (2487), 955 states have internal predecessors, (2487), 0 states have call successors, (0), 0 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 01:04:24,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 01:04:24,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:24,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:24,261 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:24,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:24,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1051691639, now seen corresponding path program 1 times [2024-11-10 01:04:24,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:24,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078691996] [2024-11-10 01:04:24,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:24,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:24,676 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 01:04:24,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:24,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078691996] [2024-11-10 01:04:24,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078691996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:24,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:24,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 01:04:24,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951560815] [2024-11-10 01:04:24,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:24,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:04:24,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:24,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:04:24,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:04:24,713 INFO L87 Difference]: Start difference. First operand has 956 states, 953 states have (on average 2.6096537250786986) internal successors, (2487), 955 states have internal predecessors, (2487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 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 01:04:29,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:29,680 INFO L93 Difference]: Finished difference Result 2597 states and 7023 transitions. [2024-11-10 01:04:29,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:04:29,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-11-10 01:04:29,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:29,711 INFO L225 Difference]: With dead ends: 2597 [2024-11-10 01:04:29,711 INFO L226 Difference]: Without dead ends: 1640 [2024-11-10 01:04:29,717 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 01:04:29,720 INFO L432 NwaCegarLoop]: 812 mSDtfsCounter, 1720 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3617 mSolverCounterSat, 724 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1720 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 4341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 724 IncrementalHoareTripleChecker+Valid, 3617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-10 01:04:29,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1720 Valid, 825 Invalid, 4341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [724 Valid, 3617 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-10 01:04:29,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2024-11-10 01:04:29,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2024-11-10 01:04:29,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1638 states have (on average 2.4053724053724053) internal successors, (3940), 1639 states have internal predecessors, (3940), 0 states have call successors, (0), 0 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 01:04:29,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 3940 transitions. [2024-11-10 01:04:29,828 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 3940 transitions. Word has length 18 [2024-11-10 01:04:29,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:29,828 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 3940 transitions. [2024-11-10 01:04:29,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 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 01:04:29,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 3940 transitions. [2024-11-10 01:04:29,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 01:04:29,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:29,831 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 01:04:29,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:04:29,832 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:29,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:29,833 INFO L85 PathProgramCache]: Analyzing trace with hash -728446663, now seen corresponding path program 1 times [2024-11-10 01:04:29,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:29,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146395473] [2024-11-10 01:04:29,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:29,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:30,140 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 01:04:30,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:30,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146395473] [2024-11-10 01:04:30,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146395473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:30,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:30,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:04:30,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650361246] [2024-11-10 01:04:30,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:30,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:04:30,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:30,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:04:30,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:04:30,147 INFO L87 Difference]: Start difference. First operand 1640 states and 3940 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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 01:04:30,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:30,261 INFO L93 Difference]: Finished difference Result 1709 states and 4047 transitions. [2024-11-10 01:04:30,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:04:30,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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 01:04:30,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:30,270 INFO L225 Difference]: With dead ends: 1709 [2024-11-10 01:04:30,270 INFO L226 Difference]: Without dead ends: 1640 [2024-11-10 01:04:30,271 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 01:04:30,272 INFO L432 NwaCegarLoop]: 2350 mSDtfsCounter, 0 mSDsluCounter, 6984 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9334 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:04:30,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9334 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:04:30,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2024-11-10 01:04:30,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2024-11-10 01:04:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1638 states have (on average 2.368131868131868) internal successors, (3879), 1639 states have internal predecessors, (3879), 0 states have call successors, (0), 0 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 01:04:30,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 3879 transitions. [2024-11-10 01:04:30,311 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 3879 transitions. Word has length 32 [2024-11-10 01:04:30,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:30,311 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 3879 transitions. [2024-11-10 01:04:30,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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 01:04:30,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 3879 transitions. [2024-11-10 01:04:30,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-10 01:04:30,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:30,315 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:30,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:04:30,315 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:30,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:30,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1809746510, now seen corresponding path program 1 times [2024-11-10 01:04:30,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:30,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370522215] [2024-11-10 01:04:30,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:30,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:30,440 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:04:30,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:30,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370522215] [2024-11-10 01:04:30,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370522215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:30,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:30,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:04:30,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226259034] [2024-11-10 01:04:30,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:30,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:04:30,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:30,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:04:30,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:04:30,445 INFO L87 Difference]: Start difference. First operand 1640 states and 3879 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 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 01:04:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:34,998 INFO L93 Difference]: Finished difference Result 4651 states and 11291 transitions. [2024-11-10 01:04:34,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:04:34,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-11-10 01:04:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:35,018 INFO L225 Difference]: With dead ends: 4651 [2024-11-10 01:04:35,018 INFO L226 Difference]: Without dead ends: 3144 [2024-11-10 01:04:35,022 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 01:04:35,026 INFO L432 NwaCegarLoop]: 1923 mSDtfsCounter, 1442 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 3733 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1442 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 4444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 3733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:04:35,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1442 Valid, 2103 Invalid, 4444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 3733 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-10 01:04:35,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2024-11-10 01:04:35,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 3144. [2024-11-10 01:04:35,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3144 states, 3142 states have (on average 2.3294080203691916) internal successors, (7319), 3143 states have internal predecessors, (7319), 0 states have call successors, (0), 0 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 01:04:35,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3144 states to 3144 states and 7319 transitions. [2024-11-10 01:04:35,105 INFO L78 Accepts]: Start accepts. Automaton has 3144 states and 7319 transitions. Word has length 90 [2024-11-10 01:04:35,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:35,105 INFO L471 AbstractCegarLoop]: Abstraction has 3144 states and 7319 transitions. [2024-11-10 01:04:35,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 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 01:04:35,106 INFO L276 IsEmpty]: Start isEmpty. Operand 3144 states and 7319 transitions. [2024-11-10 01:04:35,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 01:04:35,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:35,112 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:35,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:04:35,113 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:35,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:35,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1192133036, now seen corresponding path program 1 times [2024-11-10 01:04:35,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:35,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663944415] [2024-11-10 01:04:35,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:35,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:35,309 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:04:35,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:35,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663944415] [2024-11-10 01:04:35,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663944415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:35,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:35,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 01:04:35,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239864146] [2024-11-10 01:04:35,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:35,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:04:35,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:35,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:04:35,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:04:35,313 INFO L87 Difference]: Start difference. First operand 3144 states and 7319 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 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 01:04:39,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:39,025 INFO L93 Difference]: Finished difference Result 9166 states and 21613 transitions. [2024-11-10 01:04:39,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:04:39,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-11-10 01:04:39,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:39,052 INFO L225 Difference]: With dead ends: 9166 [2024-11-10 01:04:39,052 INFO L226 Difference]: Without dead ends: 6155 [2024-11-10 01:04:39,058 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 01:04:39,059 INFO L432 NwaCegarLoop]: 517 mSDtfsCounter, 1768 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3669 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1768 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 4219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 3669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:04:39,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1768 Valid, 526 Invalid, 4219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 3669 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-10 01:04:39,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6155 states. [2024-11-10 01:04:39,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6155 to 6152. [2024-11-10 01:04:39,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6152 states, 6150 states have (on average 2.2269918699186992) internal successors, (13696), 6151 states have internal predecessors, (13696), 0 states have call successors, (0), 0 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 01:04:39,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6152 states to 6152 states and 13696 transitions. [2024-11-10 01:04:39,194 INFO L78 Accepts]: Start accepts. Automaton has 6152 states and 13696 transitions. Word has length 92 [2024-11-10 01:04:39,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:39,194 INFO L471 AbstractCegarLoop]: Abstraction has 6152 states and 13696 transitions. [2024-11-10 01:04:39,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 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 01:04:39,195 INFO L276 IsEmpty]: Start isEmpty. Operand 6152 states and 13696 transitions. [2024-11-10 01:04:39,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 01:04:39,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:39,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:39,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:04:39,198 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:39,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:39,198 INFO L85 PathProgramCache]: Analyzing trace with hash -234036099, now seen corresponding path program 1 times [2024-11-10 01:04:39,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:39,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552617782] [2024-11-10 01:04:39,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:39,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:39,540 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 01:04:39,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:39,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552617782] [2024-11-10 01:04:39,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552617782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:39,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:39,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:04:39,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639440348] [2024-11-10 01:04:39,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:39,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:04:39,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:39,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:04:39,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:04:39,544 INFO L87 Difference]: Start difference. First operand 6152 states and 13696 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 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 01:04:40,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:40,094 INFO L93 Difference]: Finished difference Result 7192 states and 15344 transitions. [2024-11-10 01:04:40,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 01:04:40,095 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-11-10 01:04:40,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:40,126 INFO L225 Difference]: With dead ends: 7192 [2024-11-10 01:04:40,126 INFO L226 Difference]: Without dead ends: 7127 [2024-11-10 01:04:40,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-10 01:04:40,131 INFO L432 NwaCegarLoop]: 2285 mSDtfsCounter, 19002 mSDsluCounter, 4183 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19002 SdHoareTripleChecker+Valid, 6468 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:04:40,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19002 Valid, 6468 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:04:40,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7127 states. [2024-11-10 01:04:40,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7127 to 6214. [2024-11-10 01:04:40,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6214 states, 6212 states have (on average 2.2207018673535095) internal successors, (13795), 6213 states have internal predecessors, (13795), 0 states have call successors, (0), 0 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 01:04:40,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 13795 transitions. [2024-11-10 01:04:40,413 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 13795 transitions. Word has length 92 [2024-11-10 01:04:40,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:40,414 INFO L471 AbstractCegarLoop]: Abstraction has 6214 states and 13795 transitions. [2024-11-10 01:04:40,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 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 01:04:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 13795 transitions. [2024-11-10 01:04:40,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 01:04:40,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:40,416 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:40,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 01:04:40,416 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:40,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:40,419 INFO L85 PathProgramCache]: Analyzing trace with hash 718968799, now seen corresponding path program 1 times [2024-11-10 01:04:40,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:40,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873222804] [2024-11-10 01:04:40,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:40,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:41,104 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 01:04:41,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:41,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873222804] [2024-11-10 01:04:41,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873222804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:41,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:41,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:04:41,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576350262] [2024-11-10 01:04:41,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:41,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:04:41,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:41,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:04:41,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:04:41,110 INFO L87 Difference]: Start difference. First operand 6214 states and 13795 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 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 01:04:41,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:41,608 INFO L93 Difference]: Finished difference Result 6344 states and 13999 transitions. [2024-11-10 01:04:41,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:04:41,609 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 01:04:41,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:41,627 INFO L225 Difference]: With dead ends: 6344 [2024-11-10 01:04:41,627 INFO L226 Difference]: Without dead ends: 6217 [2024-11-10 01:04:41,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-10 01:04:41,631 INFO L432 NwaCegarLoop]: 2281 mSDtfsCounter, 2277 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2277 SdHoareTripleChecker+Valid, 3093 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:04:41,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2277 Valid, 3093 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:04:41,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6217 states. [2024-11-10 01:04:41,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6217 to 6214. [2024-11-10 01:04:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6214 states, 6212 states have (on average 2.2205408886027045) internal successors, (13794), 6213 states have internal predecessors, (13794), 0 states have call successors, (0), 0 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 01:04:41,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 13794 transitions. [2024-11-10 01:04:41,792 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 13794 transitions. Word has length 94 [2024-11-10 01:04:41,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:41,792 INFO L471 AbstractCegarLoop]: Abstraction has 6214 states and 13794 transitions. [2024-11-10 01:04:41,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 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 01:04:41,793 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 13794 transitions. [2024-11-10 01:04:41,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 01:04:41,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:41,794 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:41,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 01:04:41,795 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:41,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:41,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1757951802, now seen corresponding path program 1 times [2024-11-10 01:04:41,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:41,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065033022] [2024-11-10 01:04:41,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:41,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:41,954 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 01:04:41,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:41,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065033022] [2024-11-10 01:04:41,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065033022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:41,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:41,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:04:41,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711496519] [2024-11-10 01:04:41,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:41,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:04:41,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:41,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:04:41,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:04:41,957 INFO L87 Difference]: Start difference. First operand 6214 states and 13794 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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 01:04:42,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:42,038 INFO L93 Difference]: Finished difference Result 6456 states and 14176 transitions. [2024-11-10 01:04:42,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:04:42,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-10 01:04:42,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:42,058 INFO L225 Difference]: With dead ends: 6456 [2024-11-10 01:04:42,058 INFO L226 Difference]: Without dead ends: 6329 [2024-11-10 01:04:42,061 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 01:04:42,063 INFO L432 NwaCegarLoop]: 2287 mSDtfsCounter, 2192 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2192 SdHoareTripleChecker+Valid, 2383 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:04:42,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2192 Valid, 2383 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:04:42,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6329 states. [2024-11-10 01:04:42,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6329 to 6324. [2024-11-10 01:04:42,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6324 states, 6322 states have (on average 2.20911104080987) internal successors, (13966), 6323 states have internal predecessors, (13966), 0 states have call successors, (0), 0 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 01:04:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6324 states to 6324 states and 13966 transitions. [2024-11-10 01:04:42,235 INFO L78 Accepts]: Start accepts. Automaton has 6324 states and 13966 transitions. Word has length 95 [2024-11-10 01:04:42,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:42,236 INFO L471 AbstractCegarLoop]: Abstraction has 6324 states and 13966 transitions. [2024-11-10 01:04:42,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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 01:04:42,237 INFO L276 IsEmpty]: Start isEmpty. Operand 6324 states and 13966 transitions. [2024-11-10 01:04:42,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:04:42,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:42,239 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:42,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 01:04:42,239 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:42,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:42,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1443423329, now seen corresponding path program 1 times [2024-11-10 01:04:42,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:42,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029310610] [2024-11-10 01:04:42,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:42,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:42,358 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 01:04:42,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:42,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029310610] [2024-11-10 01:04:42,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029310610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:42,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:42,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:04:42,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475813856] [2024-11-10 01:04:42,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:42,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:04:42,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:42,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:04:42,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:04:42,361 INFO L87 Difference]: Start difference. First operand 6324 states and 13966 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 01:04:42,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:42,431 INFO L93 Difference]: Finished difference Result 6782 states and 14684 transitions. [2024-11-10 01:04:42,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:04:42,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-10 01:04:42,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:42,450 INFO L225 Difference]: With dead ends: 6782 [2024-11-10 01:04:42,451 INFO L226 Difference]: Without dead ends: 6545 [2024-11-10 01:04:42,455 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 01:04:42,457 INFO L432 NwaCegarLoop]: 2370 mSDtfsCounter, 2211 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2211 SdHoareTripleChecker+Valid, 2478 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 01:04:42,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2211 Valid, 2478 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:04:42,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6545 states. [2024-11-10 01:04:42,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6545 to 6542. [2024-11-10 01:04:42,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6542 states, 6540 states have (on average 2.187308868501529) internal successors, (14305), 6541 states have internal predecessors, (14305), 0 states have call successors, (0), 0 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 01:04:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 14305 transitions. [2024-11-10 01:04:42,578 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 14305 transitions. Word has length 96 [2024-11-10 01:04:42,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:42,578 INFO L471 AbstractCegarLoop]: Abstraction has 6542 states and 14305 transitions. [2024-11-10 01:04:42,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 01:04:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 14305 transitions. [2024-11-10 01:04:42,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:04:42,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:42,580 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:42,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 01:04:42,580 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:42,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:42,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1743444063, now seen corresponding path program 1 times [2024-11-10 01:04:42,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:42,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362635178] [2024-11-10 01:04:42,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:42,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:42,663 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 01:04:42,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:42,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362635178] [2024-11-10 01:04:42,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362635178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:42,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:42,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:04:42,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136542450] [2024-11-10 01:04:42,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:42,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:04:42,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:42,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:04:42,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:04:42,665 INFO L87 Difference]: Start difference. First operand 6542 states and 14305 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 01:04:42,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:42,784 INFO L93 Difference]: Finished difference Result 7420 states and 15673 transitions. [2024-11-10 01:04:42,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:04:42,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-10 01:04:42,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:42,799 INFO L225 Difference]: With dead ends: 7420 [2024-11-10 01:04:42,799 INFO L226 Difference]: Without dead ends: 6965 [2024-11-10 01:04:42,802 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 01:04:42,802 INFO L432 NwaCegarLoop]: 2368 mSDtfsCounter, 2209 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2209 SdHoareTripleChecker+Valid, 2480 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 01:04:42,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2209 Valid, 2480 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:04:42,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6965 states. [2024-11-10 01:04:42,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6965 to 6962. [2024-11-10 01:04:42,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6962 states, 6960 states have (on average 2.148132183908046) internal successors, (14951), 6961 states have internal predecessors, (14951), 0 states have call successors, (0), 0 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 01:04:42,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6962 states to 6962 states and 14951 transitions. [2024-11-10 01:04:42,914 INFO L78 Accepts]: Start accepts. Automaton has 6962 states and 14951 transitions. Word has length 96 [2024-11-10 01:04:42,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:42,914 INFO L471 AbstractCegarLoop]: Abstraction has 6962 states and 14951 transitions. [2024-11-10 01:04:42,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 01:04:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 6962 states and 14951 transitions. [2024-11-10 01:04:42,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:04:42,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:42,916 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:42,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 01:04:42,916 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:42,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:42,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1778982433, now seen corresponding path program 1 times [2024-11-10 01:04:42,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:42,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634488258] [2024-11-10 01:04:42,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:42,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:43,002 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 01:04:43,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:43,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634488258] [2024-11-10 01:04:43,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634488258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:43,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:43,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:04:43,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251475514] [2024-11-10 01:04:43,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:43,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:04:43,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:43,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:04:43,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:04:43,004 INFO L87 Difference]: Start difference. First operand 6962 states and 14951 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 01:04:43,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:43,067 INFO L93 Difference]: Finished difference Result 8648 states and 17555 transitions. [2024-11-10 01:04:43,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:04:43,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-10 01:04:43,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:43,087 INFO L225 Difference]: With dead ends: 8648 [2024-11-10 01:04:43,087 INFO L226 Difference]: Without dead ends: 7773 [2024-11-10 01:04:43,092 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 01:04:43,093 INFO L432 NwaCegarLoop]: 2356 mSDtfsCounter, 2205 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2205 SdHoareTripleChecker+Valid, 2476 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 01:04:43,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2205 Valid, 2476 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:04:43,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7773 states. [2024-11-10 01:04:43,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7773 to 7770. [2024-11-10 01:04:43,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7770 states, 7768 states have (on average 2.082775489186406) internal successors, (16179), 7769 states have internal predecessors, (16179), 0 states have call successors, (0), 0 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 01:04:43,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7770 states to 7770 states and 16179 transitions. [2024-11-10 01:04:43,228 INFO L78 Accepts]: Start accepts. Automaton has 7770 states and 16179 transitions. Word has length 96 [2024-11-10 01:04:43,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:43,229 INFO L471 AbstractCegarLoop]: Abstraction has 7770 states and 16179 transitions. [2024-11-10 01:04:43,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 01:04:43,229 INFO L276 IsEmpty]: Start isEmpty. Operand 7770 states and 16179 transitions. [2024-11-10 01:04:43,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:04:43,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:43,230 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:43,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 01:04:43,231 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:43,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:43,231 INFO L85 PathProgramCache]: Analyzing trace with hash 777572705, now seen corresponding path program 1 times [2024-11-10 01:04:43,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:43,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630308010] [2024-11-10 01:04:43,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:43,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:43,314 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 01:04:43,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:43,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630308010] [2024-11-10 01:04:43,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630308010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:43,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:43,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:04:43,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861781223] [2024-11-10 01:04:43,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:43,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:04:43,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:43,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:04:43,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:04:43,317 INFO L87 Difference]: Start difference. First operand 7770 states and 16179 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 01:04:43,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:43,400 INFO L93 Difference]: Finished difference Result 11008 states and 21127 transitions. [2024-11-10 01:04:43,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:04:43,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-10 01:04:43,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:43,421 INFO L225 Difference]: With dead ends: 11008 [2024-11-10 01:04:43,421 INFO L226 Difference]: Without dead ends: 9325 [2024-11-10 01:04:43,427 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 01:04:43,427 INFO L432 NwaCegarLoop]: 2354 mSDtfsCounter, 2203 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2203 SdHoareTripleChecker+Valid, 2478 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 01:04:43,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2203 Valid, 2478 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:04:43,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9325 states. [2024-11-10 01:04:43,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9325 to 9322. [2024-11-10 01:04:43,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9322 states, 9320 states have (on average 1.9857296137339056) internal successors, (18507), 9321 states have internal predecessors, (18507), 0 states have call successors, (0), 0 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 01:04:43,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9322 states to 9322 states and 18507 transitions. [2024-11-10 01:04:43,597 INFO L78 Accepts]: Start accepts. Automaton has 9322 states and 18507 transitions. Word has length 96 [2024-11-10 01:04:43,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:43,598 INFO L471 AbstractCegarLoop]: Abstraction has 9322 states and 18507 transitions. [2024-11-10 01:04:43,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 01:04:43,598 INFO L276 IsEmpty]: Start isEmpty. Operand 9322 states and 18507 transitions. [2024-11-10 01:04:43,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:04:43,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:43,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:43,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 01:04:43,600 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:43,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:43,600 INFO L85 PathProgramCache]: Analyzing trace with hash 763122849, now seen corresponding path program 1 times [2024-11-10 01:04:43,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:43,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642232438] [2024-11-10 01:04:43,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:43,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:43,691 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 01:04:43,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:43,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642232438] [2024-11-10 01:04:43,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642232438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:43,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:43,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:04:43,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762094804] [2024-11-10 01:04:43,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:43,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:04:43,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:43,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:04:43,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:04:43,694 INFO L87 Difference]: Start difference. First operand 9322 states and 18507 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 01:04:43,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:43,831 INFO L93 Difference]: Finished difference Result 15536 states and 27887 transitions. [2024-11-10 01:04:43,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:04:43,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-10 01:04:43,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:43,859 INFO L225 Difference]: With dead ends: 15536 [2024-11-10 01:04:43,859 INFO L226 Difference]: Without dead ends: 12301 [2024-11-10 01:04:43,867 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 01:04:43,868 INFO L432 NwaCegarLoop]: 2352 mSDtfsCounter, 2201 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2201 SdHoareTripleChecker+Valid, 2480 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 01:04:43,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2201 Valid, 2480 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:04:43,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12301 states. [2024-11-10 01:04:44,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12301 to 12298. [2024-11-10 01:04:44,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12298 states, 12296 states have (on average 1.8629635653871177) internal successors, (22907), 12297 states have internal predecessors, (22907), 0 states have call successors, (0), 0 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 01:04:44,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12298 states to 12298 states and 22907 transitions. [2024-11-10 01:04:44,119 INFO L78 Accepts]: Start accepts. Automaton has 12298 states and 22907 transitions. Word has length 96 [2024-11-10 01:04:44,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:44,120 INFO L471 AbstractCegarLoop]: Abstraction has 12298 states and 22907 transitions. [2024-11-10 01:04:44,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 01:04:44,120 INFO L276 IsEmpty]: Start isEmpty. Operand 12298 states and 22907 transitions. [2024-11-10 01:04:44,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:04:44,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:44,122 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:04:44,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 01:04:44,122 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:44,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:44,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1440241695, now seen corresponding path program 1 times [2024-11-10 01:04:44,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:44,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362870993] [2024-11-10 01:04:44,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:44,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:44,213 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 01:04:44,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:44,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362870993] [2024-11-10 01:04:44,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362870993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:44,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:44,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:04:44,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762863964] [2024-11-10 01:04:44,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:44,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:04:44,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:44,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:04:44,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:04:44,215 INFO L87 Difference]: Start difference. First operand 12298 states and 22907 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 01:04:44,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:44,412 INFO L93 Difference]: Finished difference Result 24208 states and 40639 transitions. [2024-11-10 01:04:44,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:04:44,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-10 01:04:44,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:44,449 INFO L225 Difference]: With dead ends: 24208 [2024-11-10 01:04:44,450 INFO L226 Difference]: Without dead ends: 17997 [2024-11-10 01:04:44,463 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 01:04:44,464 INFO L432 NwaCegarLoop]: 2350 mSDtfsCounter, 2199 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2199 SdHoareTripleChecker+Valid, 2482 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 01:04:44,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2199 Valid, 2482 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:04:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17997 states. [2024-11-10 01:04:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17997 to 17994. [2024-11-10 01:04:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17994 states, 17992 states have (on average 1.7338261449533126) internal successors, (31195), 17993 states have internal predecessors, (31195), 0 states have call successors, (0), 0 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 01:04:44,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17994 states to 17994 states and 31195 transitions. [2024-11-10 01:04:44,966 INFO L78 Accepts]: Start accepts. Automaton has 17994 states and 31195 transitions. Word has length 96 [2024-11-10 01:04:44,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:44,967 INFO L471 AbstractCegarLoop]: Abstraction has 17994 states and 31195 transitions. [2024-11-10 01:04:44,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 01:04:44,967 INFO L276 IsEmpty]: Start isEmpty. Operand 17994 states and 31195 transitions. [2024-11-10 01:04:44,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:04:44,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:44,968 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:44,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 01:04:44,969 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:44,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:44,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1964518750, now seen corresponding path program 1 times [2024-11-10 01:04:44,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:44,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550088718] [2024-11-10 01:04:44,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:44,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:45,281 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 01:04:45,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:45,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550088718] [2024-11-10 01:04:45,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550088718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:45,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:45,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:04:45,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248538524] [2024-11-10 01:04:45,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:45,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:04:45,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:45,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:04:45,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:04:45,284 INFO L87 Difference]: Start difference. First operand 17994 states and 31195 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 01:04:45,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:45,509 INFO L93 Difference]: Finished difference Result 18381 states and 31709 transitions. [2024-11-10 01:04:45,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:04:45,510 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-10 01:04:45,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:45,552 INFO L225 Difference]: With dead ends: 18381 [2024-11-10 01:04:45,552 INFO L226 Difference]: Without dead ends: 18378 [2024-11-10 01:04:45,561 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 01:04:45,561 INFO L432 NwaCegarLoop]: 2285 mSDtfsCounter, 0 mSDsluCounter, 13697 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15982 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:04:45,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15982 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:04:45,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18378 states. [2024-11-10 01:04:45,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18378 to 18378. [2024-11-10 01:04:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18378 states, 18376 states have (on average 1.7150087070091424) internal successors, (31515), 18377 states have internal predecessors, (31515), 0 states have call successors, (0), 0 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 01:04:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18378 states to 18378 states and 31515 transitions. [2024-11-10 01:04:45,929 INFO L78 Accepts]: Start accepts. Automaton has 18378 states and 31515 transitions. Word has length 96 [2024-11-10 01:04:45,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:45,929 INFO L471 AbstractCegarLoop]: Abstraction has 18378 states and 31515 transitions. [2024-11-10 01:04:45,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 01:04:45,930 INFO L276 IsEmpty]: Start isEmpty. Operand 18378 states and 31515 transitions. [2024-11-10 01:04:45,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:04:45,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:45,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:45,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 01:04:45,931 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:45,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:45,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2061056737, now seen corresponding path program 1 times [2024-11-10 01:04:45,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:45,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40957782] [2024-11-10 01:04:45,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:45,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:04:46,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:46,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40957782] [2024-11-10 01:04:46,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40957782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:46,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:46,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:04:46,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817467386] [2024-11-10 01:04:46,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:46,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:04:46,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:46,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:04:46,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:04:46,013 INFO L87 Difference]: Start difference. First operand 18378 states and 31515 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 01:04:46,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:46,496 INFO L93 Difference]: Finished difference Result 41936 states and 65567 transitions. [2024-11-10 01:04:46,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:04:46,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-10 01:04:46,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:46,557 INFO L225 Difference]: With dead ends: 41936 [2024-11-10 01:04:46,557 INFO L226 Difference]: Without dead ends: 29645 [2024-11-10 01:04:46,577 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 01:04:46,578 INFO L432 NwaCegarLoop]: 2366 mSDtfsCounter, 2207 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2207 SdHoareTripleChecker+Valid, 2482 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 01:04:46,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2207 Valid, 2482 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:04:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29645 states. [2024-11-10 01:04:47,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29645 to 29642. [2024-11-10 01:04:47,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29642 states, 29640 states have (on average 1.5987516869095817) internal successors, (47387), 29641 states have internal predecessors, (47387), 0 states have call successors, (0), 0 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 01:04:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29642 states to 29642 states and 47387 transitions. [2024-11-10 01:04:47,213 INFO L78 Accepts]: Start accepts. Automaton has 29642 states and 47387 transitions. Word has length 96 [2024-11-10 01:04:47,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:47,214 INFO L471 AbstractCegarLoop]: Abstraction has 29642 states and 47387 transitions. [2024-11-10 01:04:47,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 01:04:47,214 INFO L276 IsEmpty]: Start isEmpty. Operand 29642 states and 47387 transitions. [2024-11-10 01:04:47,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 01:04:47,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:47,215 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:47,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 01:04:47,216 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:47,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:47,216 INFO L85 PathProgramCache]: Analyzing trace with hash -873321882, now seen corresponding path program 1 times [2024-11-10 01:04:47,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:47,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406819170] [2024-11-10 01:04:47,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:47,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:47,316 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:04:47,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:47,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406819170] [2024-11-10 01:04:47,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406819170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:47,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:47,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 01:04:47,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097516929] [2024-11-10 01:04:47,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:47,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:04:47,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:47,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:04:47,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:04:47,320 INFO L87 Difference]: Start difference. First operand 29642 states and 47387 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 01:04:51,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:51,738 INFO L93 Difference]: Finished difference Result 40928 states and 72979 transitions. [2024-11-10 01:04:51,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:04:51,738 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 01:04:51,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:51,807 INFO L225 Difference]: With dead ends: 40928 [2024-11-10 01:04:51,808 INFO L226 Difference]: Without dead ends: 34909 [2024-11-10 01:04:51,823 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 01:04:51,824 INFO L432 NwaCegarLoop]: 665 mSDtfsCounter, 1572 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3633 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 4284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 3633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:04:51,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1572 Valid, 674 Invalid, 4284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 3633 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-10 01:04:51,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34909 states. [2024-11-10 01:04:52,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34909 to 34906. [2024-11-10 01:04:52,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34906 states, 34904 states have (on average 1.6656830162732066) internal successors, (58139), 34905 states have internal predecessors, (58139), 0 states have call successors, (0), 0 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 01:04:52,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34906 states to 34906 states and 58139 transitions. [2024-11-10 01:04:52,650 INFO L78 Accepts]: Start accepts. Automaton has 34906 states and 58139 transitions. Word has length 98 [2024-11-10 01:04:52,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:52,650 INFO L471 AbstractCegarLoop]: Abstraction has 34906 states and 58139 transitions. [2024-11-10 01:04:52,650 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 01:04:52,651 INFO L276 IsEmpty]: Start isEmpty. Operand 34906 states and 58139 transitions. [2024-11-10 01:04:52,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 01:04:52,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:04:52,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 01:04:52,652 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:52,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:52,652 INFO L85 PathProgramCache]: Analyzing trace with hash -360366943, now seen corresponding path program 1 times [2024-11-10 01:04:52,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:52,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487673966] [2024-11-10 01:04:52,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:52,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:52,727 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 01:04:52,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:52,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487673966] [2024-11-10 01:04:52,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487673966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:52,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:52,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:04:52,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637335201] [2024-11-10 01:04:52,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:52,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:04:52,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:52,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:04:52,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:04:52,730 INFO L87 Difference]: Start difference. First operand 34906 states and 58139 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 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 01:04:53,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:53,395 INFO L93 Difference]: Finished difference Result 59492 states and 93732 transitions. [2024-11-10 01:04:53,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:04:53,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 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 01:04:53,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:53,468 INFO L225 Difference]: With dead ends: 59492 [2024-11-10 01:04:53,468 INFO L226 Difference]: Without dead ends: 46432 [2024-11-10 01:04:53,496 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 01:04:53,497 INFO L432 NwaCegarLoop]: 2375 mSDtfsCounter, 2210 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2210 SdHoareTripleChecker+Valid, 2479 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 01:04:53,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2210 Valid, 2479 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:04:53,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46432 states. [2024-11-10 01:04:54,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46432 to 46429. [2024-11-10 01:04:54,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46429 states, 46427 states have (on average 1.6024726990759688) internal successors, (74398), 46428 states have internal predecessors, (74398), 0 states have call successors, (0), 0 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 01:04:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46429 states to 46429 states and 74398 transitions. [2024-11-10 01:04:54,607 INFO L78 Accepts]: Start accepts. Automaton has 46429 states and 74398 transitions. Word has length 98 [2024-11-10 01:04:54,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:54,607 INFO L471 AbstractCegarLoop]: Abstraction has 46429 states and 74398 transitions. [2024-11-10 01:04:54,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 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 01:04:54,608 INFO L276 IsEmpty]: Start isEmpty. Operand 46429 states and 74398 transitions. [2024-11-10 01:04:54,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 01:04:54,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:54,616 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:04:54,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 01:04:54,616 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:54,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:54,617 INFO L85 PathProgramCache]: Analyzing trace with hash -469450845, now seen corresponding path program 1 times [2024-11-10 01:04:54,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:54,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115512606] [2024-11-10 01:04:54,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:54,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:54,936 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 01:04:54,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:54,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115512606] [2024-11-10 01:04:54,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115512606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:54,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:54,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:04:54,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961259393] [2024-11-10 01:04:54,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:54,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:04:54,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:54,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:04:54,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:04:54,939 INFO L87 Difference]: Start difference. First operand 46429 states and 74398 transitions. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 0 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 01:04:59,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:59,113 INFO L93 Difference]: Finished difference Result 334200 states and 484656 transitions. [2024-11-10 01:04:59,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:04:59,113 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 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 123 [2024-11-10 01:04:59,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:59,693 INFO L225 Difference]: With dead ends: 334200 [2024-11-10 01:04:59,693 INFO L226 Difference]: Without dead ends: 299125 [2024-11-10 01:05:00,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-10 01:05:00,082 INFO L432 NwaCegarLoop]: 2401 mSDtfsCounter, 16568 mSDsluCounter, 4077 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16568 SdHoareTripleChecker+Valid, 6478 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:05:00,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16568 Valid, 6478 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:05:00,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299125 states. [2024-11-10 01:05:03,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299125 to 81501. [2024-11-10 01:05:03,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81501 states, 81499 states have (on average 1.5222518067706352) internal successors, (124062), 81500 states have internal predecessors, (124062), 0 states have call successors, (0), 0 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 01:05:03,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81501 states to 81501 states and 124062 transitions. [2024-11-10 01:05:03,949 INFO L78 Accepts]: Start accepts. Automaton has 81501 states and 124062 transitions. Word has length 123 [2024-11-10 01:05:03,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:03,950 INFO L471 AbstractCegarLoop]: Abstraction has 81501 states and 124062 transitions. [2024-11-10 01:05:03,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 0 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 01:05:03,950 INFO L276 IsEmpty]: Start isEmpty. Operand 81501 states and 124062 transitions. [2024-11-10 01:05:03,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 01:05:03,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:03,967 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:05:03,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 01:05:03,967 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:03,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:03,968 INFO L85 PathProgramCache]: Analyzing trace with hash 638649059, now seen corresponding path program 1 times [2024-11-10 01:05:03,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:03,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635499324] [2024-11-10 01:05:03,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:03,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:04,230 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 01:05:04,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:04,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635499324] [2024-11-10 01:05:04,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635499324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:04,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:04,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:05:04,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734096664] [2024-11-10 01:05:04,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:04,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:05:04,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:04,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:05:04,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:05:04,234 INFO L87 Difference]: Start difference. First operand 81501 states and 124062 transitions. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 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 01:05:10,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:10,184 INFO L93 Difference]: Finished difference Result 369272 states and 534320 transitions. [2024-11-10 01:05:10,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:05:10,185 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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 123 [2024-11-10 01:05:10,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:11,026 INFO L225 Difference]: With dead ends: 369272 [2024-11-10 01:05:11,026 INFO L226 Difference]: Without dead ends: 334197 [2024-11-10 01:05:11,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-10 01:05:11,122 INFO L432 NwaCegarLoop]: 2397 mSDtfsCounter, 16613 mSDsluCounter, 3943 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16613 SdHoareTripleChecker+Valid, 6340 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:05:11,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16613 Valid, 6340 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:05:11,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334197 states. [2024-11-10 01:05:16,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334197 to 134237. [2024-11-10 01:05:16,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134237 states, 134235 states have (on average 1.477274928297389) internal successors, (198302), 134236 states have internal predecessors, (198302), 0 states have call successors, (0), 0 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 01:05:16,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134237 states to 134237 states and 198302 transitions. [2024-11-10 01:05:16,816 INFO L78 Accepts]: Start accepts. Automaton has 134237 states and 198302 transitions. Word has length 123 [2024-11-10 01:05:16,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:16,817 INFO L471 AbstractCegarLoop]: Abstraction has 134237 states and 198302 transitions. [2024-11-10 01:05:16,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 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 01:05:16,817 INFO L276 IsEmpty]: Start isEmpty. Operand 134237 states and 198302 transitions. [2024-11-10 01:05:16,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 01:05:16,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:16,830 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:05:16,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 01:05:16,830 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:16,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:16,830 INFO L85 PathProgramCache]: Analyzing trace with hash -133891741, now seen corresponding path program 1 times [2024-11-10 01:05:16,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:16,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856072147] [2024-11-10 01:05:16,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:16,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 01:05:17,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:17,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856072147] [2024-11-10 01:05:17,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856072147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:17,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:17,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:05:17,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450320411] [2024-11-10 01:05:17,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:17,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:05:17,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:17,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:05:17,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:05:17,111 INFO L87 Difference]: Start difference. First operand 134237 states and 198302 transitions. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 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 01:05:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:24,204 INFO L93 Difference]: Finished difference Result 404344 states and 583984 transitions. [2024-11-10 01:05:24,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:05:24,205 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 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 123 [2024-11-10 01:05:24,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:24,890 INFO L225 Difference]: With dead ends: 404344 [2024-11-10 01:05:24,890 INFO L226 Difference]: Without dead ends: 369269