./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.7_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d26a7b46bddf6c261a466d1462327f17b82fcb8ce3fd85c9d86242e35c98838f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:02:22,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:02:22,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 01:02:22,606 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:02:22,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:02:22,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:02:22,641 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:02:22,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:02:22,643 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:02:22,644 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:02:22,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:02:22,645 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:02:22,646 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:02:22,646 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:02:22,646 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:02:22,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:02:22,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:02:22,647 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 01:02:22,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:02:22,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 01:02:22,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:02:22,651 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:02:22,651 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:02:22,652 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:02:22,652 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:02:22,655 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 01:02:22,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:02:22,655 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:02:22,655 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:02:22,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:02:22,656 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:02:22,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:02:22,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:02:22,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:02:22,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:02:22,657 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:02:22,658 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:02:22,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:02:22,658 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:02:22,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:02:22,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:02:22,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:02:22,660 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 -> d26a7b46bddf6c261a466d1462327f17b82fcb8ce3fd85c9d86242e35c98838f [2024-11-10 01:02:22,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:02:22,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:02:22,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:02:22,951 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:02:22,951 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:02:22,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-10 01:02:24,412 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:02:24,906 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:02:24,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-10 01:02:24,955 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/271ef9190/5266a70131cf4ebb954b6cd77951e548/FLAG290f5d32f [2024-11-10 01:02:25,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/271ef9190/5266a70131cf4ebb954b6cd77951e548 [2024-11-10 01:02:25,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:02:25,010 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:02:25,011 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:02:25,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:02:25,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:02:25,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:02:25" (1/1) ... [2024-11-10 01:02:25,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ab238ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:25, skipping insertion in model container [2024-11-10 01:02:25,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:02:25" (1/1) ... [2024-11-10 01:02:25,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:02:25,609 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.7_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[20528,20541] [2024-11-10 01:02:25,710 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.7_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[27818,27831] [2024-11-10 01:02:26,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:02:26,367 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:02:26,416 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.7_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[20528,20541] [2024-11-10 01:02:26,428 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.7_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[27818,27831] [2024-11-10 01:02:26,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:02:26,933 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:02:26,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:26 WrapperNode [2024-11-10 01:02:26,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:02:26,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:02:26,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:02:26,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:02:26,953 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:02:26" (1/1) ... [2024-11-10 01:02:27,036 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:02:26" (1/1) ... [2024-11-10 01:02:27,317 INFO L138 Inliner]: procedures = 39, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5215 [2024-11-10 01:02:27,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:02:27,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:02:27,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:02:27,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:02:27,329 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:26" (1/1) ... [2024-11-10 01:02:27,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:26" (1/1) ... [2024-11-10 01:02:27,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:26" (1/1) ... [2024-11-10 01:02:27,632 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:02:27,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:26" (1/1) ... [2024-11-10 01:02:27,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:26" (1/1) ... [2024-11-10 01:02:27,813 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:26" (1/1) ... [2024-11-10 01:02:27,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:26" (1/1) ... [2024-11-10 01:02:27,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:26" (1/1) ... [2024-11-10 01:02:27,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:26" (1/1) ... [2024-11-10 01:02:27,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:02:27,931 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:02:27,932 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:02:27,932 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:02:27,933 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:26" (1/1) ... [2024-11-10 01:02:27,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:02:27,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:02:27,966 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:02:27,969 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:02:28,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:02:28,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:02:28,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:02:28,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:02:28,127 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:02:28,129 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:02:33,890 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5255: havoc calculate_output3_#t~ret47#1; [2024-11-10 01:02:33,890 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2286: havoc calculate_output_#t~ret45#1; [2024-11-10 01:02:33,891 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3765: havoc calculate_output2_#t~ret46#1; [2024-11-10 01:02:34,283 INFO L? ?]: Removed 2091 outVars from TransFormulas that were not future-live. [2024-11-10 01:02:34,284 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:02:34,323 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:02:34,324 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:02:34,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:02:34 BoogieIcfgContainer [2024-11-10 01:02:34,325 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:02:34,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:02:34,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:02:34,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:02:34,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:02:25" (1/3) ... [2024-11-10 01:02:34,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc8b1ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:02:34, skipping insertion in model container [2024-11-10 01:02:34,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:26" (2/3) ... [2024-11-10 01:02:34,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc8b1ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:02:34, skipping insertion in model container [2024-11-10 01:02:34,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:02:34" (3/3) ... [2024-11-10 01:02:34,335 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-10 01:02:34,352 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:02:34,352 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 01:02:34,458 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:02:34,466 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;@3e8ad204, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:02:34,466 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 01:02:34,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 937 states, 934 states have (on average 2.6252676659528906) internal successors, (2452), 936 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have 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:02:34,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 01:02:34,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:34,491 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] [2024-11-10 01:02:34,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:34,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:34,497 INFO L85 PathProgramCache]: Analyzing trace with hash -685889018, now seen corresponding path program 1 times [2024-11-10 01:02:34,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:34,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89669662] [2024-11-10 01:02:34,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:34,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:34,825 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:02:34,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:34,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89669662] [2024-11-10 01:02:34,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89669662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:34,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:34,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 01:02:34,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683622947] [2024-11-10 01:02:34,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:34,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 01:02:34,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:34,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 01:02:34,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 01:02:34,859 INFO L87 Difference]: Start difference. First operand has 937 states, 934 states have (on average 2.6252676659528906) internal successors, (2452), 936 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have 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:02:34,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:34,968 INFO L93 Difference]: Finished difference Result 1814 states and 4792 transitions. [2024-11-10 01:02:34,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 01:02:34,974 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-10 01:02:34,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:35,008 INFO L225 Difference]: With dead ends: 1814 [2024-11-10 01:02:35,008 INFO L226 Difference]: Without dead ends: 869 [2024-11-10 01:02:35,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 01:02:35,017 INFO L432 NwaCegarLoop]: 2381 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2381 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:35,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:02:35,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2024-11-10 01:02:35,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 869. [2024-11-10 01:02:35,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 867 states have (on average 2.6724336793540946) internal successors, (2317), 868 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have 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:02:35,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 2317 transitions. [2024-11-10 01:02:35,103 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 2317 transitions. Word has length 30 [2024-11-10 01:02:35,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:35,103 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 2317 transitions. [2024-11-10 01:02:35,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have 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:02:35,104 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 2317 transitions. [2024-11-10 01:02:35,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 01:02:35,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:35,106 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] [2024-11-10 01:02:35,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:02:35,106 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:35,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:35,107 INFO L85 PathProgramCache]: Analyzing trace with hash -752895771, now seen corresponding path program 1 times [2024-11-10 01:02:35,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:35,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694114003] [2024-11-10 01:02:35,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:35,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:35,362 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:02:35,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:35,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694114003] [2024-11-10 01:02:35,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694114003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:35,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:35,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:02:35,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264506261] [2024-11-10 01:02:35,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:35,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:02:35,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:35,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:02:35,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:02:35,367 INFO L87 Difference]: Start difference. First operand 869 states and 2317 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have 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:02:35,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:35,538 INFO L93 Difference]: Finished difference Result 930 states and 2411 transitions. [2024-11-10 01:02:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:02:35,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-10 01:02:35,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:35,544 INFO L225 Difference]: With dead ends: 930 [2024-11-10 01:02:35,545 INFO L226 Difference]: Without dead ends: 869 [2024-11-10 01:02:35,546 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:02:35,547 INFO L432 NwaCegarLoop]: 2315 mSDtfsCounter, 0 mSDsluCounter, 6890 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9205 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:35,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9205 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:02:35,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2024-11-10 01:02:35,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 869. [2024-11-10 01:02:35,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 867 states have (on average 2.6147635524798156) internal successors, (2267), 868 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states have 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:02:35,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 2267 transitions. [2024-11-10 01:02:35,585 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 2267 transitions. Word has length 30 [2024-11-10 01:02:35,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:35,586 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 2267 transitions. [2024-11-10 01:02:35,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have 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:02:35,587 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 2267 transitions. [2024-11-10 01:02:35,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 01:02:35,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:35,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:02:35,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:02:35,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:35,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:35,591 INFO L85 PathProgramCache]: Analyzing trace with hash -735299423, now seen corresponding path program 1 times [2024-11-10 01:02:35,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:35,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768933796] [2024-11-10 01:02:35,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:35,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:35,852 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:02:35,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:35,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768933796] [2024-11-10 01:02:35,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768933796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:35,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:35,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:02:35,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968145962] [2024-11-10 01:02:35,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:35,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:02:35,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:35,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:02:35,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:02:35,860 INFO L87 Difference]: Start difference. First operand 869 states and 2267 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:02:43,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:43,872 INFO L93 Difference]: Finished difference Result 3128 states and 8620 transitions. [2024-11-10 01:02:43,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:02:43,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-10 01:02:43,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:43,883 INFO L225 Difference]: With dead ends: 3128 [2024-11-10 01:02:43,884 INFO L226 Difference]: Without dead ends: 2373 [2024-11-10 01:02:43,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:02:43,886 INFO L432 NwaCegarLoop]: 823 mSDtfsCounter, 4521 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 8074 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4521 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 9227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 8074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:43,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4521 Valid, 846 Invalid, 9227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 8074 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-11-10 01:02:43,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2024-11-10 01:02:43,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2373. [2024-11-10 01:02:43,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2373 states, 2371 states have (on average 2.4221847321805146) internal successors, (5743), 2372 states have internal predecessors, (5743), 0 states have call successors, (0), 0 states have 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:02:43,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 2373 states and 5743 transitions. [2024-11-10 01:02:43,953 INFO L78 Accepts]: Start accepts. Automaton has 2373 states and 5743 transitions. Word has length 65 [2024-11-10 01:02:43,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:43,954 INFO L471 AbstractCegarLoop]: Abstraction has 2373 states and 5743 transitions. [2024-11-10 01:02:43,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:02:43,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2373 states and 5743 transitions. [2024-11-10 01:02:43,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 01:02:43,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:43,958 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] [2024-11-10 01:02:43,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:02:43,958 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:43,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:43,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1903427819, now seen corresponding path program 1 times [2024-11-10 01:02:43,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:43,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671980870] [2024-11-10 01:02:43,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:43,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:44,258 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:02:44,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:44,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671980870] [2024-11-10 01:02:44,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671980870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:44,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:44,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:02:44,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095163631] [2024-11-10 01:02:44,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:44,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:02:44,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:44,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:02:44,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:02:44,261 INFO L87 Difference]: Start difference. First operand 2373 states and 5743 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have 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:02:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:44,670 INFO L93 Difference]: Finished difference Result 3171 states and 7003 transitions. [2024-11-10 01:02:44,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 01:02:44,670 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-10 01:02:44,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:44,684 INFO L225 Difference]: With dead ends: 3171 [2024-11-10 01:02:44,685 INFO L226 Difference]: Without dead ends: 3114 [2024-11-10 01:02:44,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2024-11-10 01:02:44,689 INFO L432 NwaCegarLoop]: 2263 mSDtfsCounter, 16322 mSDsluCounter, 3401 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16322 SdHoareTripleChecker+Valid, 5664 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:44,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16322 Valid, 5664 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:02:44,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2024-11-10 01:02:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 2427. [2024-11-10 01:02:44,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 2425 states have (on average 2.4037113402061854) internal successors, (5829), 2426 states have internal predecessors, (5829), 0 states have call successors, (0), 0 states have 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:02:44,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 5829 transitions. [2024-11-10 01:02:44,751 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 5829 transitions. Word has length 79 [2024-11-10 01:02:44,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:44,752 INFO L471 AbstractCegarLoop]: Abstraction has 2427 states and 5829 transitions. [2024-11-10 01:02:44,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have 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:02:44,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 5829 transitions. [2024-11-10 01:02:44,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 01:02:44,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:44,755 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] [2024-11-10 01:02:44,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:02:44,755 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:44,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:44,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1827426509, now seen corresponding path program 1 times [2024-11-10 01:02:44,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:44,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734475608] [2024-11-10 01:02:44,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:44,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:45,225 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:02:45,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:45,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734475608] [2024-11-10 01:02:45,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734475608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:45,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:45,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:02:45,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239055527] [2024-11-10 01:02:45,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:45,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:02:45,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:45,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:02:45,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:02:45,229 INFO L87 Difference]: Start difference. First operand 2427 states and 5829 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:02:45,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:45,594 INFO L93 Difference]: Finished difference Result 2541 states and 6007 transitions. [2024-11-10 01:02:45,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:02:45,595 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-10 01:02:45,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:45,605 INFO L225 Difference]: With dead ends: 2541 [2024-11-10 01:02:45,605 INFO L226 Difference]: Without dead ends: 2430 [2024-11-10 01:02:45,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-10 01:02:45,607 INFO L432 NwaCegarLoop]: 2258 mSDtfsCounter, 2243 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2243 SdHoareTripleChecker+Valid, 2874 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:45,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2243 Valid, 2874 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:02:45,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2024-11-10 01:02:45,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2427. [2024-11-10 01:02:45,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 2425 states have (on average 2.403298969072165) internal successors, (5828), 2426 states have internal predecessors, (5828), 0 states have call successors, (0), 0 states have 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:02:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 5828 transitions. [2024-11-10 01:02:45,656 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 5828 transitions. Word has length 81 [2024-11-10 01:02:45,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:45,657 INFO L471 AbstractCegarLoop]: Abstraction has 2427 states and 5828 transitions. [2024-11-10 01:02:45,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:02:45,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 5828 transitions. [2024-11-10 01:02:45,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 01:02:45,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:45,658 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] [2024-11-10 01:02:45,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 01:02:45,659 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:45,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:45,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1755501160, now seen corresponding path program 1 times [2024-11-10 01:02:45,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:45,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446031697] [2024-11-10 01:02:45,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:45,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:45,747 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:02:45,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:45,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446031697] [2024-11-10 01:02:45,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446031697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:45,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:45,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:02:45,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818247923] [2024-11-10 01:02:45,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:45,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:02:45,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:45,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:02:45,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:45,749 INFO L87 Difference]: Start difference. First operand 2427 states and 5828 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have 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:02:45,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:45,798 INFO L93 Difference]: Finished difference Result 2637 states and 6158 transitions. [2024-11-10 01:02:45,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:02:45,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-10 01:02:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:45,810 INFO L225 Difference]: With dead ends: 2637 [2024-11-10 01:02:45,810 INFO L226 Difference]: Without dead ends: 2526 [2024-11-10 01:02:45,811 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:02:45,812 INFO L432 NwaCegarLoop]: 2273 mSDtfsCounter, 2182 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2182 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:45,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2182 Valid, 2358 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:02:45,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2024-11-10 01:02:45,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2523. [2024-11-10 01:02:45,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2523 states, 2521 states have (on average 2.3712812376041255) internal successors, (5978), 2522 states have internal predecessors, (5978), 0 states have call successors, (0), 0 states have 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:02:45,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 5978 transitions. [2024-11-10 01:02:45,955 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 5978 transitions. Word has length 82 [2024-11-10 01:02:45,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:45,955 INFO L471 AbstractCegarLoop]: Abstraction has 2523 states and 5978 transitions. [2024-11-10 01:02:45,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have 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:02:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 5978 transitions. [2024-11-10 01:02:45,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:02:45,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:45,958 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] [2024-11-10 01:02:45,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 01:02:45,958 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:45,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:45,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1519393231, now seen corresponding path program 1 times [2024-11-10 01:02:45,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:45,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410675217] [2024-11-10 01:02:45,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:45,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:46,049 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:02:46,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:46,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410675217] [2024-11-10 01:02:46,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410675217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:46,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:46,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:02:46,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999039182] [2024-11-10 01:02:46,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:46,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:02:46,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:46,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:02:46,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:46,053 INFO L87 Difference]: Start difference. First operand 2523 states and 5978 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:02:46,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:46,098 INFO L93 Difference]: Finished difference Result 2740 states and 6318 transitions. [2024-11-10 01:02:46,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:02:46,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-10 01:02:46,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:46,109 INFO L225 Difference]: With dead ends: 2740 [2024-11-10 01:02:46,110 INFO L226 Difference]: Without dead ends: 2629 [2024-11-10 01:02:46,111 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:02:46,112 INFO L432 NwaCegarLoop]: 2341 mSDtfsCounter, 2200 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2200 SdHoareTripleChecker+Valid, 2432 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:02:46,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2200 Valid, 2432 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:02:46,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2024-11-10 01:02:46,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2626. [2024-11-10 01:02:46,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2624 states have (on average 2.339176829268293) internal successors, (6138), 2625 states have internal predecessors, (6138), 0 states have call successors, (0), 0 states have 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:02:46,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 6138 transitions. [2024-11-10 01:02:46,185 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 6138 transitions. Word has length 83 [2024-11-10 01:02:46,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:46,186 INFO L471 AbstractCegarLoop]: Abstraction has 2626 states and 6138 transitions. [2024-11-10 01:02:46,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:02:46,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 6138 transitions. [2024-11-10 01:02:46,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:02:46,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:46,188 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] [2024-11-10 01:02:46,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 01:02:46,188 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:46,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:46,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1667474161, now seen corresponding path program 1 times [2024-11-10 01:02:46,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:46,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206400678] [2024-11-10 01:02:46,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:46,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:46,265 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:02:46,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:46,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206400678] [2024-11-10 01:02:46,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206400678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:46,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:46,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:02:46,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145594290] [2024-11-10 01:02:46,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:46,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:02:46,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:46,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:02:46,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:46,269 INFO L87 Difference]: Start difference. First operand 2626 states and 6138 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:02:46,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:46,322 INFO L93 Difference]: Finished difference Result 3216 states and 7060 transitions. [2024-11-10 01:02:46,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:02:46,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-10 01:02:46,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:46,334 INFO L225 Difference]: With dead ends: 3216 [2024-11-10 01:02:46,335 INFO L226 Difference]: Without dead ends: 2909 [2024-11-10 01:02:46,336 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:02:46,337 INFO L432 NwaCegarLoop]: 2343 mSDtfsCounter, 2198 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2198 SdHoareTripleChecker+Valid, 2438 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:02:46,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2198 Valid, 2438 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:02:46,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2024-11-10 01:02:46,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 2906. [2024-11-10 01:02:46,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2906 states, 2904 states have (on average 2.262396694214876) internal successors, (6570), 2905 states have internal predecessors, (6570), 0 states have call successors, (0), 0 states have 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:02:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2906 states and 6570 transitions. [2024-11-10 01:02:46,424 INFO L78 Accepts]: Start accepts. Automaton has 2906 states and 6570 transitions. Word has length 83 [2024-11-10 01:02:46,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:46,425 INFO L471 AbstractCegarLoop]: Abstraction has 2906 states and 6570 transitions. [2024-11-10 01:02:46,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:02:46,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 6570 transitions. [2024-11-10 01:02:46,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:02:46,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:46,426 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] [2024-11-10 01:02:46,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 01:02:46,427 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:46,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:46,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1854952335, now seen corresponding path program 1 times [2024-11-10 01:02:46,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:46,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927107264] [2024-11-10 01:02:46,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:46,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:46,512 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:02:46,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:46,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927107264] [2024-11-10 01:02:46,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927107264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:46,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:46,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:02:46,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757632076] [2024-11-10 01:02:46,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:46,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:02:46,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:46,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:02:46,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:46,515 INFO L87 Difference]: Start difference. First operand 2906 states and 6570 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:02:46,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:46,575 INFO L93 Difference]: Finished difference Result 4032 states and 8314 transitions. [2024-11-10 01:02:46,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:02:46,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-10 01:02:46,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:46,591 INFO L225 Difference]: With dead ends: 4032 [2024-11-10 01:02:46,591 INFO L226 Difference]: Without dead ends: 3445 [2024-11-10 01:02:46,594 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:02:46,595 INFO L432 NwaCegarLoop]: 2331 mSDtfsCounter, 2194 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2194 SdHoareTripleChecker+Valid, 2434 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:02:46,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2194 Valid, 2434 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:02:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3445 states. [2024-11-10 01:02:46,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3445 to 3442. [2024-11-10 01:02:46,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3442 states, 3440 states have (on average 2.147093023255814) internal successors, (7386), 3441 states have internal predecessors, (7386), 0 states have call successors, (0), 0 states have 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:02:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 3442 states and 7386 transitions. [2024-11-10 01:02:46,699 INFO L78 Accepts]: Start accepts. Automaton has 3442 states and 7386 transitions. Word has length 83 [2024-11-10 01:02:46,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:46,700 INFO L471 AbstractCegarLoop]: Abstraction has 3442 states and 7386 transitions. [2024-11-10 01:02:46,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:02:46,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3442 states and 7386 transitions. [2024-11-10 01:02:46,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:02:46,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:46,702 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] [2024-11-10 01:02:46,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 01:02:46,702 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:46,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:46,703 INFO L85 PathProgramCache]: Analyzing trace with hash 853542607, now seen corresponding path program 1 times [2024-11-10 01:02:46,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:46,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641171764] [2024-11-10 01:02:46,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:46,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:46,791 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:02:46,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:46,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641171764] [2024-11-10 01:02:46,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641171764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:46,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:46,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:02:46,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359478072] [2024-11-10 01:02:46,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:46,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:02:46,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:46,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:02:46,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:46,794 INFO L87 Difference]: Start difference. First operand 3442 states and 7386 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:02:46,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:46,882 INFO L93 Difference]: Finished difference Result 5592 states and 10678 transitions. [2024-11-10 01:02:46,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:02:46,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-10 01:02:46,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:46,910 INFO L225 Difference]: With dead ends: 5592 [2024-11-10 01:02:46,911 INFO L226 Difference]: Without dead ends: 4469 [2024-11-10 01:02:46,915 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:02:46,916 INFO L432 NwaCegarLoop]: 2329 mSDtfsCounter, 2192 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2192 SdHoareTripleChecker+Valid, 2436 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:02:46,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2192 Valid, 2436 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:02:46,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4469 states. [2024-11-10 01:02:47,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4469 to 4466. [2024-11-10 01:02:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4466 states, 4464 states have (on average 1.9986559139784945) internal successors, (8922), 4465 states have internal predecessors, (8922), 0 states have call successors, (0), 0 states have 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:02:47,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4466 states to 4466 states and 8922 transitions. [2024-11-10 01:02:47,069 INFO L78 Accepts]: Start accepts. Automaton has 4466 states and 8922 transitions. Word has length 83 [2024-11-10 01:02:47,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:47,070 INFO L471 AbstractCegarLoop]: Abstraction has 4466 states and 8922 transitions. [2024-11-10 01:02:47,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:02:47,070 INFO L276 IsEmpty]: Start isEmpty. Operand 4466 states and 8922 transitions. [2024-11-10 01:02:47,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:02:47,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:47,072 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] [2024-11-10 01:02:47,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 01:02:47,072 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:47,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:47,073 INFO L85 PathProgramCache]: Analyzing trace with hash 839092751, now seen corresponding path program 1 times [2024-11-10 01:02:47,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:47,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291965414] [2024-11-10 01:02:47,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:47,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:47,155 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:02:47,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:47,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291965414] [2024-11-10 01:02:47,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291965414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:47,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:47,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:02:47,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604592407] [2024-11-10 01:02:47,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:47,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:02:47,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:47,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:02:47,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:47,158 INFO L87 Difference]: Start difference. First operand 4466 states and 8922 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:02:47,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:47,256 INFO L93 Difference]: Finished difference Result 8568 states and 15118 transitions. [2024-11-10 01:02:47,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:02:47,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-10 01:02:47,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:47,270 INFO L225 Difference]: With dead ends: 8568 [2024-11-10 01:02:47,270 INFO L226 Difference]: Without dead ends: 6421 [2024-11-10 01:02:47,276 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:02:47,277 INFO L432 NwaCegarLoop]: 2327 mSDtfsCounter, 2190 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2190 SdHoareTripleChecker+Valid, 2438 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:02:47,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2190 Valid, 2438 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:02:47,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6421 states. [2024-11-10 01:02:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6421 to 6418. [2024-11-10 01:02:47,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6418 states, 6416 states have (on average 1.8394638403990025) internal successors, (11802), 6417 states have internal predecessors, (11802), 0 states have call successors, (0), 0 states have 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:02:47,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6418 states to 6418 states and 11802 transitions. [2024-11-10 01:02:47,451 INFO L78 Accepts]: Start accepts. Automaton has 6418 states and 11802 transitions. Word has length 83 [2024-11-10 01:02:47,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:47,451 INFO L471 AbstractCegarLoop]: Abstraction has 6418 states and 11802 transitions. [2024-11-10 01:02:47,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:02:47,452 INFO L276 IsEmpty]: Start isEmpty. Operand 6418 states and 11802 transitions. [2024-11-10 01:02:47,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:02:47,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:47,453 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] [2024-11-10 01:02:47,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 01:02:47,453 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:47,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:47,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1364271793, now seen corresponding path program 1 times [2024-11-10 01:02:47,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:47,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140799974] [2024-11-10 01:02:47,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:47,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:47,523 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:02:47,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:47,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140799974] [2024-11-10 01:02:47,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140799974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:47,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:47,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:02:47,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416632307] [2024-11-10 01:02:47,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:47,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:02:47,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:47,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:02:47,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:47,526 INFO L87 Difference]: Start difference. First operand 6418 states and 11802 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:02:47,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:47,765 INFO L93 Difference]: Finished difference Result 14232 states and 23422 transitions. [2024-11-10 01:02:47,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:02:47,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-10 01:02:47,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:47,787 INFO L225 Difference]: With dead ends: 14232 [2024-11-10 01:02:47,787 INFO L226 Difference]: Without dead ends: 10133 [2024-11-10 01:02:47,795 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:02:47,796 INFO L432 NwaCegarLoop]: 2325 mSDtfsCounter, 2188 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2188 SdHoareTripleChecker+Valid, 2440 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:02:47,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2188 Valid, 2440 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:02:47,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10133 states. [2024-11-10 01:02:48,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10133 to 10130. [2024-11-10 01:02:48,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10130 states, 10128 states have (on average 1.6960900473933649) internal successors, (17178), 10129 states have internal predecessors, (17178), 0 states have call successors, (0), 0 states have 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:02:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10130 states to 10130 states and 17178 transitions. [2024-11-10 01:02:48,052 INFO L78 Accepts]: Start accepts. Automaton has 10130 states and 17178 transitions. Word has length 83 [2024-11-10 01:02:48,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:48,052 INFO L471 AbstractCegarLoop]: Abstraction has 10130 states and 17178 transitions. [2024-11-10 01:02:48,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:02:48,053 INFO L276 IsEmpty]: Start isEmpty. Operand 10130 states and 17178 transitions. [2024-11-10 01:02:48,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:02:48,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:48,054 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] [2024-11-10 01:02:48,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 01:02:48,054 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:48,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:48,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1888548848, now seen corresponding path program 1 times [2024-11-10 01:02:48,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:48,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431454599] [2024-11-10 01:02:48,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:48,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:48,339 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:02:48,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:48,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431454599] [2024-11-10 01:02:48,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431454599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:48,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:48,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:02:48,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125450853] [2024-11-10 01:02:48,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:48,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:02:48,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:48,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:02:48,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:02:48,342 INFO L87 Difference]: Start difference. First operand 10130 states and 17178 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:02:48,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:48,525 INFO L93 Difference]: Finished difference Result 10517 states and 17692 transitions. [2024-11-10 01:02:48,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:02:48,526 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-10 01:02:48,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:48,546 INFO L225 Difference]: With dead ends: 10517 [2024-11-10 01:02:48,546 INFO L226 Difference]: Without dead ends: 10514 [2024-11-10 01:02:48,550 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:02:48,550 INFO L432 NwaCegarLoop]: 2261 mSDtfsCounter, 0 mSDsluCounter, 13553 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15814 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:02:48,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15814 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:02:48,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10514 states. [2024-11-10 01:02:48,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10514 to 10514. [2024-11-10 01:02:48,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10514 states, 10512 states have (on average 1.6676179604261796) internal successors, (17530), 10513 states have internal predecessors, (17530), 0 states have call successors, (0), 0 states have 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:02:48,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10514 states to 10514 states and 17530 transitions. [2024-11-10 01:02:48,804 INFO L78 Accepts]: Start accepts. Automaton has 10514 states and 17530 transitions. Word has length 83 [2024-11-10 01:02:48,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:48,805 INFO L471 AbstractCegarLoop]: Abstraction has 10514 states and 17530 transitions. [2024-11-10 01:02:48,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:02:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 10514 states and 17530 transitions. [2024-11-10 01:02:48,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:02:48,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:48,806 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] [2024-11-10 01:02:48,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 01:02:48,807 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:48,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:48,807 INFO L85 PathProgramCache]: Analyzing trace with hash 2137026639, now seen corresponding path program 1 times [2024-11-10 01:02:48,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:48,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595626149] [2024-11-10 01:02:48,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:48,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:48,873 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:02:48,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:48,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595626149] [2024-11-10 01:02:48,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595626149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:48,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:48,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:02:48,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569835320] [2024-11-10 01:02:48,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:48,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:02:48,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:48,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:02:48,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:48,875 INFO L87 Difference]: Start difference. First operand 10514 states and 17530 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:02:49,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:49,200 INFO L93 Difference]: Finished difference Result 26136 states and 39934 transitions. [2024-11-10 01:02:49,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:02:49,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-10 01:02:49,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:49,238 INFO L225 Difference]: With dead ends: 26136 [2024-11-10 01:02:49,238 INFO L226 Difference]: Without dead ends: 17941 [2024-11-10 01:02:49,252 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:02:49,253 INFO L432 NwaCegarLoop]: 2341 mSDtfsCounter, 2196 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2196 SdHoareTripleChecker+Valid, 2440 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:02:49,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2196 Valid, 2440 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:02:49,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17941 states. [2024-11-10 01:02:49,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17941 to 17938. [2024-11-10 01:02:49,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17938 states, 17936 states have (on average 1.553635147190009) internal successors, (27866), 17937 states have internal predecessors, (27866), 0 states have call successors, (0), 0 states have 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:02:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17938 states to 17938 states and 27866 transitions. [2024-11-10 01:02:49,677 INFO L78 Accepts]: Start accepts. Automaton has 17938 states and 27866 transitions. Word has length 83 [2024-11-10 01:02:49,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:49,678 INFO L471 AbstractCegarLoop]: Abstraction has 17938 states and 27866 transitions. [2024-11-10 01:02:49,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:02:49,678 INFO L276 IsEmpty]: Start isEmpty. Operand 17938 states and 27866 transitions. [2024-11-10 01:02:49,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:02:49,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:49,684 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 01:02:49,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 01:02:49,684 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:49,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:49,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1954013601, now seen corresponding path program 1 times [2024-11-10 01:02:49,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:49,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751518092] [2024-11-10 01:02:49,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:49,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:49,958 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 01:02:49,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:49,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751518092] [2024-11-10 01:02:49,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751518092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:49,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:49,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:02:49,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107486237] [2024-11-10 01:02:49,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:49,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:02:49,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:49,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:02:49,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:02:49,961 INFO L87 Difference]: Start difference. First operand 17938 states and 27866 transitions. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:02:52,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:52,003 INFO L93 Difference]: Finished difference Result 125930 states and 181290 transitions. [2024-11-10 01:02:52,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:02:52,004 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-10 01:02:52,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:52,319 INFO L225 Difference]: With dead ends: 125930 [2024-11-10 01:02:52,319 INFO L226 Difference]: Without dead ends: 114919 [2024-11-10 01:02:52,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:02:52,363 INFO L432 NwaCegarLoop]: 2358 mSDtfsCounter, 13990 mSDsluCounter, 3606 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13990 SdHoareTripleChecker+Valid, 5964 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:52,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13990 Valid, 5964 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:02:52,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114919 states. [2024-11-10 01:02:53,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114919 to 31314. [2024-11-10 01:02:53,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31314 states, 31312 states have (on average 1.4908661216147163) internal successors, (46682), 31313 states have internal predecessors, (46682), 0 states have call successors, (0), 0 states have 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:02:53,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31314 states to 31314 states and 46682 transitions. [2024-11-10 01:02:53,998 INFO L78 Accepts]: Start accepts. Automaton has 31314 states and 46682 transitions. Word has length 108 [2024-11-10 01:02:53,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:53,999 INFO L471 AbstractCegarLoop]: Abstraction has 31314 states and 46682 transitions. [2024-11-10 01:02:53,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:02:53,999 INFO L276 IsEmpty]: Start isEmpty. Operand 31314 states and 46682 transitions. [2024-11-10 01:02:54,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:02:54,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:54,006 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 01:02:54,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 01:02:54,007 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:54,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:54,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1232853791, now seen corresponding path program 1 times [2024-11-10 01:02:54,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:54,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075102585] [2024-11-10 01:02:54,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:54,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:54,304 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 01:02:54,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:54,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075102585] [2024-11-10 01:02:54,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075102585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:54,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:54,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:02:54,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799756838] [2024-11-10 01:02:54,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:54,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:02:54,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:54,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:02:54,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:02:54,306 INFO L87 Difference]: Start difference. First operand 31314 states and 46682 transitions. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have 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:02:56,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:56,821 INFO L93 Difference]: Finished difference Result 141546 states and 203370 transitions. [2024-11-10 01:02:56,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:02:56,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-10 01:02:56,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:57,096 INFO L225 Difference]: With dead ends: 141546 [2024-11-10 01:02:57,097 INFO L226 Difference]: Without dead ends: 125927 [2024-11-10 01:02:57,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:02:57,171 INFO L432 NwaCegarLoop]: 2359 mSDtfsCounter, 13987 mSDsluCounter, 3584 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13987 SdHoareTripleChecker+Valid, 5943 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:57,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13987 Valid, 5943 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:02:57,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125927 states. [2024-11-10 01:02:59,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125927 to 52434. [2024-11-10 01:02:59,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52434 states, 52432 states have (on average 1.4567058285016783) internal successors, (76378), 52433 states have internal predecessors, (76378), 0 states have call successors, (0), 0 states have 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:02:59,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52434 states to 52434 states and 76378 transitions. [2024-11-10 01:02:59,333 INFO L78 Accepts]: Start accepts. Automaton has 52434 states and 76378 transitions. Word has length 108 [2024-11-10 01:02:59,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:59,334 INFO L471 AbstractCegarLoop]: Abstraction has 52434 states and 76378 transitions. [2024-11-10 01:02:59,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have 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:02:59,335 INFO L276 IsEmpty]: Start isEmpty. Operand 52434 states and 76378 transitions. [2024-11-10 01:02:59,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:02:59,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:59,344 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 01:02:59,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 01:02:59,345 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:59,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:59,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2005394591, now seen corresponding path program 1 times [2024-11-10 01:02:59,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:59,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070498047] [2024-11-10 01:02:59,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:59,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:59,847 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 01:02:59,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:59,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070498047] [2024-11-10 01:02:59,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070498047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:59,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:59,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:02:59,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856437019] [2024-11-10 01:02:59,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:59,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:02:59,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:59,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:02:59,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:02:59,850 INFO L87 Difference]: Start difference. First operand 52434 states and 76378 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have 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:03:02,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:03:02,989 INFO L93 Difference]: Finished difference Result 157162 states and 225386 transitions. [2024-11-10 01:03:02,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:03:02,990 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-10 01:03:02,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:03:03,229 INFO L225 Difference]: With dead ends: 157162 [2024-11-10 01:03:03,229 INFO L226 Difference]: Without dead ends: 141543 [2024-11-10 01:03:03,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:03:03,273 INFO L432 NwaCegarLoop]: 2356 mSDtfsCounter, 14033 mSDsluCounter, 3599 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14033 SdHoareTripleChecker+Valid, 5955 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:03:03,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14033 Valid, 5955 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:03:03,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141543 states. [2024-11-10 01:03:05,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141543 to 68050. [2024-11-10 01:03:05,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68050 states, 68048 states have (on average 1.4459499177051494) internal successors, (98394), 68049 states have internal predecessors, (98394), 0 states have call successors, (0), 0 states have 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:03:05,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68050 states to 68050 states and 98394 transitions. [2024-11-10 01:03:05,922 INFO L78 Accepts]: Start accepts. Automaton has 68050 states and 98394 transitions. Word has length 108 [2024-11-10 01:03:05,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:03:05,923 INFO L471 AbstractCegarLoop]: Abstraction has 68050 states and 98394 transitions. [2024-11-10 01:03:05,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have 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:03:05,923 INFO L276 IsEmpty]: Start isEmpty. Operand 68050 states and 98394 transitions. [2024-11-10 01:03:05,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:03:05,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:03:05,933 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 01:03:05,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 01:03:05,934 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:03:05,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:03:05,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1288162977, now seen corresponding path program 1 times [2024-11-10 01:03:05,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:03:05,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169369156] [2024-11-10 01:03:05,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:03:05,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:03:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:03:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 01:03:06,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:03:06,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169369156] [2024-11-10 01:03:06,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169369156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:03:06,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:03:06,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:03:06,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108324303] [2024-11-10 01:03:06,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:03:06,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:03:06,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:03:06,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:03:06,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:03:06,233 INFO L87 Difference]: Start difference. First operand 68050 states and 98394 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 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:03:10,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:03:10,313 INFO L93 Difference]: Finished difference Result 172778 states and 247402 transitions. [2024-11-10 01:03:10,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:03:10,314 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 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 108 [2024-11-10 01:03:10,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:03:10,581 INFO L225 Difference]: With dead ends: 172778 [2024-11-10 01:03:10,581 INFO L226 Difference]: Without dead ends: 157159 [2024-11-10 01:03:10,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:03:10,622 INFO L432 NwaCegarLoop]: 2353 mSDtfsCounter, 14090 mSDsluCounter, 3516 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14090 SdHoareTripleChecker+Valid, 5869 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:03:10,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14090 Valid, 5869 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:03:10,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157159 states. [2024-11-10 01:03:13,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157159 to 83666. [2024-11-10 01:03:13,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83666 states, 83664 states have (on average 1.4392092178236757) internal successors, (120410), 83665 states have internal predecessors, (120410), 0 states have call successors, (0), 0 states have 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:03:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83666 states to 83666 states and 120410 transitions. [2024-11-10 01:03:13,993 INFO L78 Accepts]: Start accepts. Automaton has 83666 states and 120410 transitions. Word has length 108 [2024-11-10 01:03:13,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:03:13,994 INFO L471 AbstractCegarLoop]: Abstraction has 83666 states and 120410 transitions. [2024-11-10 01:03:13,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 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:03:13,995 INFO L276 IsEmpty]: Start isEmpty. Operand 83666 states and 120410 transitions. [2024-11-10 01:03:14,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:03:14,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:03:14,004 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 01:03:14,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 01:03:14,004 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:03:14,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:03:14,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1273713121, now seen corresponding path program 1 times [2024-11-10 01:03:14,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:03:14,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530196459] [2024-11-10 01:03:14,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:03:14,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:03:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:03:14,225 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-10 01:03:14,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:03:14,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530196459] [2024-11-10 01:03:14,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530196459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:03:14,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:03:14,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:03:14,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969798913] [2024-11-10 01:03:14,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:03:14,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:03:14,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:03:14,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:03:14,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:03:14,228 INFO L87 Difference]: Start difference. First operand 83666 states and 120410 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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:03:18,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:03:18,305 INFO L93 Difference]: Finished difference Result 188394 states and 269418 transitions. [2024-11-10 01:03:18,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:03:18,306 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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 108 [2024-11-10 01:03:18,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:03:18,559 INFO L225 Difference]: With dead ends: 188394 [2024-11-10 01:03:18,559 INFO L226 Difference]: Without dead ends: 172775 [2024-11-10 01:03:18,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:03:18,599 INFO L432 NwaCegarLoop]: 2350 mSDtfsCounter, 14150 mSDsluCounter, 3505 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14150 SdHoareTripleChecker+Valid, 5855 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:03:18,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14150 Valid, 5855 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:03:18,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172775 states. [2024-11-10 01:03:22,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172775 to 99282. [2024-11-10 01:03:22,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99282 states, 99280 states have (on average 1.4345890410958904) internal successors, (142426), 99281 states have internal predecessors, (142426), 0 states have call successors, (0), 0 states have 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:03:22,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99282 states to 99282 states and 142426 transitions. [2024-11-10 01:03:22,581 INFO L78 Accepts]: Start accepts. Automaton has 99282 states and 142426 transitions. Word has length 108 [2024-11-10 01:03:22,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:03:22,582 INFO L471 AbstractCegarLoop]: Abstraction has 99282 states and 142426 transitions. [2024-11-10 01:03:22,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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:03:22,582 INFO L276 IsEmpty]: Start isEmpty. Operand 99282 states and 142426 transitions. [2024-11-10 01:03:22,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:03:22,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:03:22,591 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 01:03:22,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 01:03:22,591 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:03:22,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:03:22,592 INFO L85 PathProgramCache]: Analyzing trace with hash -929651423, now seen corresponding path program 1 times [2024-11-10 01:03:22,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:03:22,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001913155] [2024-11-10 01:03:22,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:03:22,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:03:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:03:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 01:03:22,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:03:22,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001913155] [2024-11-10 01:03:22,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001913155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:03:22,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:03:22,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:03:22,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187792149] [2024-11-10 01:03:22,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:03:22,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:03:22,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:03:22,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:03:22,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:03:22,805 INFO L87 Difference]: Start difference. First operand 99282 states and 142426 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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)