./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.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/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.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 e328965cea0bb66eb9fefef2406463fafd513fe2a95976e689a71eb96c010564 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:59:38,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:59:38,974 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:59:38,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:59:38,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:59:39,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:59:39,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:59:39,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:59:39,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:59:39,028 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:59:39,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:59:39,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:59:39,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:59:39,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:59:39,032 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:59:39,032 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:59:39,032 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:59:39,032 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:59:39,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:59:39,033 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:59:39,033 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:59:39,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:59:39,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:59:39,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:59:39,037 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:59:39,037 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:59:39,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:59:39,038 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:59:39,038 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:59:39,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:59:39,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:59:39,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:59:39,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:59:39,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:59:39,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:59:39,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:59:39,039 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:59:39,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:59:39,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:59:39,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:59:39,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:59:39,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:59:39,041 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 -> e328965cea0bb66eb9fefef2406463fafd513fe2a95976e689a71eb96c010564 [2024-11-09 23:59:39,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:59:39,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:59:39,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:59:39,302 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:59:39,303 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:59:39,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-11-09 23:59:40,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:59:41,013 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:59:41,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-11-09 23:59:41,033 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff28fde0b/8af7bc67e65b44cb9fc8852365e5d33f/FLAGc41626fd3 [2024-11-09 23:59:41,375 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff28fde0b/8af7bc67e65b44cb9fc8852365e5d33f [2024-11-09 23:59:41,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:59:41,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:59:41,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:59:41,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:59:41,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:59:41,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:59:41" (1/1) ... [2024-11-09 23:59:41,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@569ab807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:41, skipping insertion in model container [2024-11-09 23:59:41,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:59:41" (1/1) ... [2024-11-09 23:59:41,435 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:59:41,678 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/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6636,6649] [2024-11-09 23:59:41,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:59:41,735 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:59:41,789 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/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6636,6649] [2024-11-09 23:59:41,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:59:41,848 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:59:41,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:41 WrapperNode [2024-11-09 23:59:41,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:59:41,849 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:59:41,849 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:59:41,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:59:41,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:41" (1/1) ... [2024-11-09 23:59:41,869 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:41" (1/1) ... [2024-11-09 23:59:41,904 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 559 [2024-11-09 23:59:41,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:59:41,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:59:41,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:59:41,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:59:41,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:41" (1/1) ... [2024-11-09 23:59:41,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:41" (1/1) ... [2024-11-09 23:59:41,920 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:41" (1/1) ... [2024-11-09 23:59:41,941 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-09 23:59:41,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:41" (1/1) ... [2024-11-09 23:59:41,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:41" (1/1) ... [2024-11-09 23:59:41,956 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:41" (1/1) ... [2024-11-09 23:59:41,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:41" (1/1) ... [2024-11-09 23:59:41,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:41" (1/1) ... [2024-11-09 23:59:41,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:41" (1/1) ... [2024-11-09 23:59:41,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:59:41,965 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:59:41,965 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:59:41,966 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:59:41,966 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:41" (1/1) ... [2024-11-09 23:59:41,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:59:41,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:59:42,003 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-09 23:59:42,008 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-09 23:59:42,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:59:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:59:42,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:59:42,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:59:42,175 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:59:42,177 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:59:42,700 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,701 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,701 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,701 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,701 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,702 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,702 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,702 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,702 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,703 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,703 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,703 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,704 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,704 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,706 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,706 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,706 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,706 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,706 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,707 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,707 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,707 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,708 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,708 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,708 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2024-11-09 23:59:42,708 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2024-11-09 23:59:42,708 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L187: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2024-11-09 23:59:42,708 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L187: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2024-11-09 23:59:42,734 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L452: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1; [2024-11-09 23:59:42,734 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L452: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1; [2024-11-09 23:59:42,734 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L452: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1; [2024-11-09 23:59:42,734 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1; [2024-11-09 23:59:42,734 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1; [2024-11-09 23:59:42,734 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1; [2024-11-09 23:59:42,734 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1; [2024-11-09 23:59:42,734 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L542: havoc main_~node2____CPAchecker_TMP_0~1#1; [2024-11-09 23:59:42,734 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L592: havoc main_~node1____CPAchecker_TMP_0~1#1; [2024-11-09 23:59:42,734 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L378: havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1; [2024-11-09 23:59:42,735 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L378: havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1; [2024-11-09 23:59:42,735 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L378: havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1; [2024-11-09 23:59:42,735 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L378: havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1; [2024-11-09 23:59:42,735 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L213: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2024-11-09 23:59:42,735 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L213: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2024-11-09 23:59:42,735 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L346: havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-09 23:59:42,735 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L346: havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-09 23:59:42,735 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L346: havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-09 23:59:42,735 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L346: havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-09 23:59:42,735 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L346: havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-09 23:59:42,736 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1; [2024-11-09 23:59:42,736 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1; [2024-11-09 23:59:42,736 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1; [2024-11-09 23:59:42,736 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1; [2024-11-09 23:59:42,736 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1; [2024-11-09 23:59:42,736 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L248: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:59:42,736 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L248: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:59:42,736 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L248: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:59:42,736 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L248: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:59:42,736 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L497: havoc main_~node3____CPAchecker_TMP_0~1#1; [2024-11-09 23:59:42,775 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2024-11-09 23:59:42,777 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:59:42,794 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:59:42,798 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:59:42,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:59:42 BoogieIcfgContainer [2024-11-09 23:59:42,799 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:59:42,801 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:59:42,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:59:42,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:59:42,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:59:41" (1/3) ... [2024-11-09 23:59:42,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348e02a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:59:42, skipping insertion in model container [2024-11-09 23:59:42,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:41" (2/3) ... [2024-11-09 23:59:42,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348e02a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:59:42, skipping insertion in model container [2024-11-09 23:59:42,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:59:42" (3/3) ... [2024-11-09 23:59:42,808 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-11-09 23:59:42,825 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:59:42,825 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:59:42,884 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:59:42,890 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;@acb2362, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:59:42,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:59:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 125 states have (on average 1.72) internal successors, (215), 126 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:42,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 23:59:42,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:42,905 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] [2024-11-09 23:59:42,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:59:42,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:42,911 INFO L85 PathProgramCache]: Analyzing trace with hash -393248013, now seen corresponding path program 1 times [2024-11-09 23:59:42,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:42,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783062576] [2024-11-09 23:59:42,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:42,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:43,477 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-09 23:59:43,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:43,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783062576] [2024-11-09 23:59:43,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783062576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:43,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:43,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:59:43,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829749524] [2024-11-09 23:59:43,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:43,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:59:43,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:43,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:59:43,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:59:43,515 INFO L87 Difference]: Start difference. First operand has 127 states, 125 states have (on average 1.72) internal successors, (215), 126 states have internal predecessors, (215), 0 states have call successors, (0), 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 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:43,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:43,825 INFO L93 Difference]: Finished difference Result 616 states and 971 transitions. [2024-11-09 23:59:43,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:59:43,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-11-09 23:59:43,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:43,843 INFO L225 Difference]: With dead ends: 616 [2024-11-09 23:59:43,844 INFO L226 Difference]: Without dead ends: 542 [2024-11-09 23:59:43,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:59:43,852 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 840 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1969 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:43,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1969 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:59:43,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-09 23:59:43,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 192. [2024-11-09 23:59:43,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.4450261780104712) internal successors, (276), 191 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:43,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 276 transitions. [2024-11-09 23:59:43,924 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 276 transitions. Word has length 61 [2024-11-09 23:59:43,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:43,924 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 276 transitions. [2024-11-09 23:59:43,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:43,925 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 276 transitions. [2024-11-09 23:59:43,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 23:59:43,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:43,927 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] [2024-11-09 23:59:43,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:59:43,927 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:59:43,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:43,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1513090792, now seen corresponding path program 1 times [2024-11-09 23:59:43,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:43,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934460996] [2024-11-09 23:59:43,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:43,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:44,179 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-09 23:59:44,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:44,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934460996] [2024-11-09 23:59:44,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934460996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:44,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:44,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:59:44,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554548329] [2024-11-09 23:59:44,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:44,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:59:44,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:44,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:59:44,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:59:44,186 INFO L87 Difference]: Start difference. First operand 192 states and 276 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:44,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:44,348 INFO L93 Difference]: Finished difference Result 697 states and 1054 transitions. [2024-11-09 23:59:44,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:59:44,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-11-09 23:59:44,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:44,352 INFO L225 Difference]: With dead ends: 697 [2024-11-09 23:59:44,352 INFO L226 Difference]: Without dead ends: 589 [2024-11-09 23:59:44,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:44,357 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 545 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:44,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1168 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:59:44,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-09 23:59:44,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 309. [2024-11-09 23:59:44,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.4870129870129871) internal successors, (458), 308 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:44,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 458 transitions. [2024-11-09 23:59:44,390 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 458 transitions. Word has length 63 [2024-11-09 23:59:44,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:44,391 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 458 transitions. [2024-11-09 23:59:44,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:44,391 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 458 transitions. [2024-11-09 23:59:44,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 23:59:44,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:44,394 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] [2024-11-09 23:59:44,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:59:44,395 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:59:44,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:44,396 INFO L85 PathProgramCache]: Analyzing trace with hash 209669423, now seen corresponding path program 1 times [2024-11-09 23:59:44,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:44,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692436849] [2024-11-09 23:59:44,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:44,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:44,611 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-09 23:59:44,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:44,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692436849] [2024-11-09 23:59:44,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692436849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:44,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:44,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:59:44,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943701983] [2024-11-09 23:59:44,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:44,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:59:44,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:44,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:59:44,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:59:44,613 INFO L87 Difference]: Start difference. First operand 309 states and 458 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:44,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:44,754 INFO L93 Difference]: Finished difference Result 814 states and 1236 transitions. [2024-11-09 23:59:44,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:59:44,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-11-09 23:59:44,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:44,760 INFO L225 Difference]: With dead ends: 814 [2024-11-09 23:59:44,760 INFO L226 Difference]: Without dead ends: 706 [2024-11-09 23:59:44,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:44,762 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 536 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:44,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 1117 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:59:44,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-11-09 23:59:44,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 479. [2024-11-09 23:59:44,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 478 states have (on average 1.5104602510460252) internal successors, (722), 478 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 722 transitions. [2024-11-09 23:59:44,786 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 722 transitions. Word has length 63 [2024-11-09 23:59:44,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:44,787 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 722 transitions. [2024-11-09 23:59:44,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 722 transitions. [2024-11-09 23:59:44,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 23:59:44,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:44,791 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:59:44,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:59:44,792 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:59:44,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:44,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1074762008, now seen corresponding path program 1 times [2024-11-09 23:59:44,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:44,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058173563] [2024-11-09 23:59:44,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:44,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:44,983 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-09 23:59:44,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:44,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058173563] [2024-11-09 23:59:44,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058173563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:44,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:44,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:59:44,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345338877] [2024-11-09 23:59:44,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:44,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:59:44,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:44,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:59:44,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:59:44,988 INFO L87 Difference]: Start difference. First operand 479 states and 722 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:45,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:45,118 INFO L93 Difference]: Finished difference Result 926 states and 1410 transitions. [2024-11-09 23:59:45,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:59:45,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-11-09 23:59:45,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:45,122 INFO L225 Difference]: With dead ends: 926 [2024-11-09 23:59:45,122 INFO L226 Difference]: Without dead ends: 818 [2024-11-09 23:59:45,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:45,126 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 611 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:45,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 984 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:59:45,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2024-11-09 23:59:45,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 591. [2024-11-09 23:59:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 1.5186440677966102) internal successors, (896), 590 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 896 transitions. [2024-11-09 23:59:45,141 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 896 transitions. Word has length 63 [2024-11-09 23:59:45,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:45,142 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 896 transitions. [2024-11-09 23:59:45,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:45,142 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 896 transitions. [2024-11-09 23:59:45,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 23:59:45,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:45,145 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] [2024-11-09 23:59:45,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:59:45,145 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:59:45,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:45,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1182307729, now seen corresponding path program 1 times [2024-11-09 23:59:45,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:45,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701534130] [2024-11-09 23:59:45,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:45,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:45,292 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-09 23:59:45,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:45,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701534130] [2024-11-09 23:59:45,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701534130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:45,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:45,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:59:45,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452284396] [2024-11-09 23:59:45,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:45,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:59:45,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:45,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:59:45,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:59:45,298 INFO L87 Difference]: Start difference. First operand 591 states and 896 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:45,408 INFO L93 Difference]: Finished difference Result 1033 states and 1576 transitions. [2024-11-09 23:59:45,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:59:45,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-11-09 23:59:45,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:45,413 INFO L225 Difference]: With dead ends: 1033 [2024-11-09 23:59:45,413 INFO L226 Difference]: Without dead ends: 925 [2024-11-09 23:59:45,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:45,414 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 685 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:45,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 971 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:59:45,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-11-09 23:59:45,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 698. [2024-11-09 23:59:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.5236728837876614) internal successors, (1062), 697 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1062 transitions. [2024-11-09 23:59:45,436 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1062 transitions. Word has length 63 [2024-11-09 23:59:45,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:45,437 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1062 transitions. [2024-11-09 23:59:45,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1062 transitions. [2024-11-09 23:59:45,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 23:59:45,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:45,439 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] [2024-11-09 23:59:45,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:59:45,440 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:59:45,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:45,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1455545666, now seen corresponding path program 1 times [2024-11-09 23:59:45,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:45,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427619413] [2024-11-09 23:59:45,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:45,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:45,705 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-09 23:59:45,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:45,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427619413] [2024-11-09 23:59:45,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427619413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:45,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:45,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:59:45,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803745682] [2024-11-09 23:59:45,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:45,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:59:45,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:45,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:59:45,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:59:45,708 INFO L87 Difference]: Start difference. First operand 698 states and 1062 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:45,829 INFO L93 Difference]: Finished difference Result 1285 states and 1972 transitions. [2024-11-09 23:59:45,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:59:45,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-09 23:59:45,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:45,832 INFO L225 Difference]: With dead ends: 1285 [2024-11-09 23:59:45,833 INFO L226 Difference]: Without dead ends: 700 [2024-11-09 23:59:45,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:59:45,834 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 408 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:45,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 542 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:59:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-09 23:59:45,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 698. [2024-11-09 23:59:45,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.51506456241033) internal successors, (1056), 697 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:45,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1056 transitions. [2024-11-09 23:59:45,848 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1056 transitions. Word has length 64 [2024-11-09 23:59:45,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:45,848 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1056 transitions. [2024-11-09 23:59:45,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:45,848 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1056 transitions. [2024-11-09 23:59:45,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 23:59:45,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:45,849 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-09 23:59:45,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:59:45,851 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:59:45,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:45,852 INFO L85 PathProgramCache]: Analyzing trace with hash 2077550100, now seen corresponding path program 1 times [2024-11-09 23:59:45,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:45,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460291048] [2024-11-09 23:59:45,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:45,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:45,971 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-09 23:59:45,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:45,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460291048] [2024-11-09 23:59:45,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460291048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:45,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:45,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:59:45,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502313554] [2024-11-09 23:59:45,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:45,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:59:45,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:45,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:59:45,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:59:45,974 INFO L87 Difference]: Start difference. First operand 698 states and 1056 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 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-09 23:59:46,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:46,090 INFO L93 Difference]: Finished difference Result 1367 states and 2082 transitions. [2024-11-09 23:59:46,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:59:46,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 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-09 23:59:46,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:46,094 INFO L225 Difference]: With dead ends: 1367 [2024-11-09 23:59:46,094 INFO L226 Difference]: Without dead ends: 698 [2024-11-09 23:59:46,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:59:46,097 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 464 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:46,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 94 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:59:46,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-11-09 23:59:46,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-11-09 23:59:46,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.497847919655667) internal successors, (1044), 697 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1044 transitions. [2024-11-09 23:59:46,110 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1044 transitions. Word has length 65 [2024-11-09 23:59:46,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:46,110 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1044 transitions. [2024-11-09 23:59:46,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 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-09 23:59:46,111 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1044 transitions. [2024-11-09 23:59:46,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 23:59:46,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:46,113 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] [2024-11-09 23:59:46,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:59:46,114 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:59:46,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:46,114 INFO L85 PathProgramCache]: Analyzing trace with hash 2009071960, now seen corresponding path program 1 times [2024-11-09 23:59:46,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:46,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005328307] [2024-11-09 23:59:46,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:46,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:46,232 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-09 23:59:46,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:46,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005328307] [2024-11-09 23:59:46,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005328307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:46,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:46,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:59:46,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614040391] [2024-11-09 23:59:46,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:46,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:59:46,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:46,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:59:46,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:59:46,235 INFO L87 Difference]: Start difference. First operand 698 states and 1044 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:46,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:46,341 INFO L93 Difference]: Finished difference Result 1355 states and 2044 transitions. [2024-11-09 23:59:46,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:59:46,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-09 23:59:46,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:46,344 INFO L225 Difference]: With dead ends: 1355 [2024-11-09 23:59:46,344 INFO L226 Difference]: Without dead ends: 698 [2024-11-09 23:59:46,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:59:46,346 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 424 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:46,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 118 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:59:46,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-11-09 23:59:46,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-11-09 23:59:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.4806312769010044) internal successors, (1032), 697 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:46,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1032 transitions. [2024-11-09 23:59:46,358 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1032 transitions. Word has length 66 [2024-11-09 23:59:46,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:46,359 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1032 transitions. [2024-11-09 23:59:46,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:46,359 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1032 transitions. [2024-11-09 23:59:46,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 23:59:46,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:46,360 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] [2024-11-09 23:59:46,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:59:46,360 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:59:46,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:46,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1038383631, now seen corresponding path program 1 times [2024-11-09 23:59:46,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:46,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760293253] [2024-11-09 23:59:46,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:46,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:46,468 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-09 23:59:46,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:46,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760293253] [2024-11-09 23:59:46,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760293253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:46,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:46,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:59:46,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647040265] [2024-11-09 23:59:46,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:46,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:59:46,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:46,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:59:46,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:59:46,471 INFO L87 Difference]: Start difference. First operand 698 states and 1032 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:46,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:46,572 INFO L93 Difference]: Finished difference Result 1363 states and 2030 transitions. [2024-11-09 23:59:46,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:59:46,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-09 23:59:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:46,575 INFO L225 Difference]: With dead ends: 1363 [2024-11-09 23:59:46,575 INFO L226 Difference]: Without dead ends: 698 [2024-11-09 23:59:46,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:59:46,577 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 440 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:46,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 102 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:59:46,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-11-09 23:59:46,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-11-09 23:59:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.4634146341463414) internal successors, (1020), 697 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:46,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1020 transitions. [2024-11-09 23:59:46,589 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1020 transitions. Word has length 67 [2024-11-09 23:59:46,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:46,589 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1020 transitions. [2024-11-09 23:59:46,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:46,590 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1020 transitions. [2024-11-09 23:59:46,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 23:59:46,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:46,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, 1, 1, 1] [2024-11-09 23:59:46,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:59:46,591 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:59:46,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:46,591 INFO L85 PathProgramCache]: Analyzing trace with hash -42430793, now seen corresponding path program 1 times [2024-11-09 23:59:46,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:46,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716592854] [2024-11-09 23:59:46,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:46,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:46,683 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-09 23:59:46,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:46,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716592854] [2024-11-09 23:59:46,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716592854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:46,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:46,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:59:46,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186828442] [2024-11-09 23:59:46,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:46,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:59:46,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:46,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:59:46,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:59:46,685 INFO L87 Difference]: Start difference. First operand 698 states and 1020 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:46,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:46,786 INFO L93 Difference]: Finished difference Result 1359 states and 2002 transitions. [2024-11-09 23:59:46,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:59:46,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-11-09 23:59:46,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:46,789 INFO L225 Difference]: With dead ends: 1359 [2024-11-09 23:59:46,789 INFO L226 Difference]: Without dead ends: 698 [2024-11-09 23:59:46,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:59:46,790 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 422 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:46,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 110 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:59:46,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-11-09 23:59:46,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-11-09 23:59:46,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.4461979913916787) internal successors, (1008), 697 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:46,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1008 transitions. [2024-11-09 23:59:46,802 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1008 transitions. Word has length 68 [2024-11-09 23:59:46,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:46,802 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1008 transitions. [2024-11-09 23:59:46,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:46,802 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1008 transitions. [2024-11-09 23:59:46,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 23:59:46,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:46,803 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] [2024-11-09 23:59:46,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 23:59:46,804 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:59:46,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:46,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1378946859, now seen corresponding path program 1 times [2024-11-09 23:59:46,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:46,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335665989] [2024-11-09 23:59:46,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:46,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:47,204 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-09 23:59:47,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:47,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335665989] [2024-11-09 23:59:47,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335665989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:47,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:47,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 23:59:47,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922555539] [2024-11-09 23:59:47,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:47,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 23:59:47,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:47,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 23:59:47,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:59:47,208 INFO L87 Difference]: Start difference. First operand 698 states and 1008 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:47,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:47,648 INFO L93 Difference]: Finished difference Result 1920 states and 2790 transitions. [2024-11-09 23:59:47,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:59:47,648 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-11-09 23:59:47,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:47,652 INFO L225 Difference]: With dead ends: 1920 [2024-11-09 23:59:47,653 INFO L226 Difference]: Without dead ends: 1330 [2024-11-09 23:59:47,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-09 23:59:47,654 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 872 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:47,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 431 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:59:47,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2024-11-09 23:59:47,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 698. [2024-11-09 23:59:47,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.4390243902439024) internal successors, (1003), 697 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:47,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1003 transitions. [2024-11-09 23:59:47,671 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1003 transitions. Word has length 69 [2024-11-09 23:59:47,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:47,671 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1003 transitions. [2024-11-09 23:59:47,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:47,672 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1003 transitions. [2024-11-09 23:59:47,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 23:59:47,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:47,672 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] [2024-11-09 23:59:47,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:59:47,673 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:59:47,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:47,673 INFO L85 PathProgramCache]: Analyzing trace with hash -13030293, now seen corresponding path program 1 times [2024-11-09 23:59:47,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:47,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587812279] [2024-11-09 23:59:47,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:47,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:47,936 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-09 23:59:47,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:47,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587812279] [2024-11-09 23:59:47,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587812279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:47,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:47,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 23:59:47,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082225267] [2024-11-09 23:59:47,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:47,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 23:59:47,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:47,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 23:59:47,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:59:47,939 INFO L87 Difference]: Start difference. First operand 698 states and 1003 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:48,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:48,383 INFO L93 Difference]: Finished difference Result 1965 states and 2849 transitions. [2024-11-09 23:59:48,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:59:48,383 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-11-09 23:59:48,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:48,387 INFO L225 Difference]: With dead ends: 1965 [2024-11-09 23:59:48,388 INFO L226 Difference]: Without dead ends: 1345 [2024-11-09 23:59:48,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-09 23:59:48,389 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 702 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:48,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 429 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:59:48,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2024-11-09 23:59:48,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 698. [2024-11-09 23:59:48,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.4361549497847919) internal successors, (1001), 697 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:48,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1001 transitions. [2024-11-09 23:59:48,406 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1001 transitions. Word has length 69 [2024-11-09 23:59:48,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:48,407 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1001 transitions. [2024-11-09 23:59:48,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:48,407 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1001 transitions. [2024-11-09 23:59:48,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 23:59:48,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:48,408 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] [2024-11-09 23:59:48,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:59:48,408 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:59:48,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:48,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1997127362, now seen corresponding path program 1 times [2024-11-09 23:59:48,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:48,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440598775] [2024-11-09 23:59:48,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:48,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:48,701 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-09 23:59:48,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:48,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440598775] [2024-11-09 23:59:48,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440598775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:48,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:48,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:59:48,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659634827] [2024-11-09 23:59:48,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:48,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:59:48,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:48,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:59:48,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:48,703 INFO L87 Difference]: Start difference. First operand 698 states and 1001 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:49,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:49,022 INFO L93 Difference]: Finished difference Result 1913 states and 2780 transitions. [2024-11-09 23:59:49,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:59:49,022 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-11-09 23:59:49,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:49,026 INFO L225 Difference]: With dead ends: 1913 [2024-11-09 23:59:49,026 INFO L226 Difference]: Without dead ends: 1288 [2024-11-09 23:59:49,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-09 23:59:49,029 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 787 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:49,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 437 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:59:49,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2024-11-09 23:59:49,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 698. [2024-11-09 23:59:49,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.4347202295552368) internal successors, (1000), 697 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1000 transitions. [2024-11-09 23:59:49,049 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1000 transitions. Word has length 69 [2024-11-09 23:59:49,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:49,049 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1000 transitions. [2024-11-09 23:59:49,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1000 transitions. [2024-11-09 23:59:49,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 23:59:49,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:49,050 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] [2024-11-09 23:59:49,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 23:59:49,050 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:59:49,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:49,051 INFO L85 PathProgramCache]: Analyzing trace with hash -333605897, now seen corresponding path program 1 times [2024-11-09 23:59:49,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:49,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861121326] [2024-11-09 23:59:49,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:49,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:49,379 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-09 23:59:49,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:49,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861121326] [2024-11-09 23:59:49,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861121326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:49,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:49,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 23:59:49,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839849036] [2024-11-09 23:59:49,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:49,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 23:59:49,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:49,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 23:59:49,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:59:49,381 INFO L87 Difference]: Start difference. First operand 698 states and 1000 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:49,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:49,831 INFO L93 Difference]: Finished difference Result 1950 states and 2822 transitions. [2024-11-09 23:59:49,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:59:49,832 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-11-09 23:59:49,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:49,836 INFO L225 Difference]: With dead ends: 1950 [2024-11-09 23:59:49,836 INFO L226 Difference]: Without dead ends: 1340 [2024-11-09 23:59:49,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2024-11-09 23:59:49,838 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 847 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:49,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 500 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:59:49,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2024-11-09 23:59:49,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 698. [2024-11-09 23:59:49,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.4289813486370158) internal successors, (996), 697 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 996 transitions. [2024-11-09 23:59:49,855 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 996 transitions. Word has length 70 [2024-11-09 23:59:49,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:49,856 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 996 transitions. [2024-11-09 23:59:49,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 996 transitions. [2024-11-09 23:59:49,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 23:59:49,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:49,857 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] [2024-11-09 23:59:49,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 23:59:49,857 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:59:49,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:49,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1325439996, now seen corresponding path program 1 times [2024-11-09 23:59:49,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:49,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868102667] [2024-11-09 23:59:49,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:49,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:51,485 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-09 23:59:51,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:51,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868102667] [2024-11-09 23:59:51,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868102667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:51,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:51,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2024-11-09 23:59:51,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520647365] [2024-11-09 23:59:51,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:51,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 23:59:51,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:51,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 23:59:51,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2024-11-09 23:59:51,487 INFO L87 Difference]: Start difference. First operand 698 states and 996 transitions. Second operand has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 27 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:54,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:54,484 INFO L93 Difference]: Finished difference Result 3369 states and 4901 transitions. [2024-11-09 23:59:54,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-09 23:59:54,485 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 27 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-09 23:59:54,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:54,494 INFO L225 Difference]: With dead ends: 3369 [2024-11-09 23:59:54,495 INFO L226 Difference]: Without dead ends: 3153 [2024-11-09 23:59:54,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=394, Invalid=2056, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 23:59:54,498 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 1308 mSDsluCounter, 4674 mSDsCounter, 0 mSdLazyCounter, 3168 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1308 SdHoareTripleChecker+Valid, 5007 SdHoareTripleChecker+Invalid, 3185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:54,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1308 Valid, 5007 Invalid, 3185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3168 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 23:59:54,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2024-11-09 23:59:54,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 723. [2024-11-09 23:59:54,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 722 states have (on average 1.422437673130194) internal successors, (1027), 722 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:54,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1027 transitions. [2024-11-09 23:59:54,530 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1027 transitions. Word has length 71 [2024-11-09 23:59:54,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:54,530 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1027 transitions. [2024-11-09 23:59:54,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 27 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1027 transitions. [2024-11-09 23:59:54,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 23:59:54,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:54,533 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] [2024-11-09 23:59:54,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:59:54,533 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:59:54,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:54,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1489786604, now seen corresponding path program 1 times [2024-11-09 23:59:54,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:54,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046223936] [2024-11-09 23:59:54,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:54,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:55,127 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-09 23:59:55,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:55,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046223936] [2024-11-09 23:59:55,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046223936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:55,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:55,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 23:59:55,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980559767] [2024-11-09 23:59:55,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:55,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 23:59:55,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:55,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 23:59:55,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:59:55,129 INFO L87 Difference]: Start difference. First operand 723 states and 1027 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:55,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:55,635 INFO L93 Difference]: Finished difference Result 1547 states and 2233 transitions. [2024-11-09 23:59:55,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 23:59:55,636 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-09 23:59:55,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:55,640 INFO L225 Difference]: With dead ends: 1547 [2024-11-09 23:59:55,640 INFO L226 Difference]: Without dead ends: 1301 [2024-11-09 23:59:55,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-11-09 23:59:55,641 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 847 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:55,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 913 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:59:55,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2024-11-09 23:59:55,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 696. [2024-11-09 23:59:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 1.4230215827338129) internal successors, (989), 695 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 989 transitions. [2024-11-09 23:59:55,656 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 989 transitions. Word has length 71 [2024-11-09 23:59:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:55,656 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 989 transitions. [2024-11-09 23:59:55,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:55,656 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 989 transitions. [2024-11-09 23:59:55,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 23:59:55,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:55,657 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] [2024-11-09 23:59:55,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 23:59:55,657 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:59:55,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:55,658 INFO L85 PathProgramCache]: Analyzing trace with hash -2083679764, now seen corresponding path program 1 times [2024-11-09 23:59:55,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:55,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716584808] [2024-11-09 23:59:55,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:55,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:57,371 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-09 23:59:57,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:57,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716584808] [2024-11-09 23:59:57,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716584808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:57,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:57,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2024-11-09 23:59:57,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715910311] [2024-11-09 23:59:57,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:57,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 23:59:57,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:57,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 23:59:57,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2024-11-09 23:59:57,374 INFO L87 Difference]: Start difference. First operand 696 states and 989 transitions. Second operand has 28 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:00,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:00,736 INFO L93 Difference]: Finished difference Result 3218 states and 4679 transitions. [2024-11-10 00:00:00,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-10 00:00:00,736 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-10 00:00:00,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:00,746 INFO L225 Difference]: With dead ends: 3218 [2024-11-10 00:00:00,746 INFO L226 Difference]: Without dead ends: 3109 [2024-11-10 00:00:00,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=459, Invalid=2193, Unknown=0, NotChecked=0, Total=2652 [2024-11-10 00:00:00,748 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 1158 mSDsluCounter, 4553 mSDsCounter, 0 mSdLazyCounter, 3033 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 4835 SdHoareTripleChecker+Invalid, 3046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:00,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 4835 Invalid, 3046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3033 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 00:00:00,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3109 states. [2024-11-10 00:00:00,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3109 to 706. [2024-11-10 00:00:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 705 states have (on average 1.4198581560283687) internal successors, (1001), 705 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1001 transitions. [2024-11-10 00:00:00,773 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1001 transitions. Word has length 71 [2024-11-10 00:00:00,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:00,773 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 1001 transitions. [2024-11-10 00:00:00,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:00,774 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1001 transitions. [2024-11-10 00:00:00,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:00:00,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:00,775 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] [2024-11-10 00:00:00,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:00:00,775 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:00,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:00,775 INFO L85 PathProgramCache]: Analyzing trace with hash 731546836, now seen corresponding path program 1 times [2024-11-10 00:00:00,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:00,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727823238] [2024-11-10 00:00:00,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:00,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:02,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:02,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:02,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727823238] [2024-11-10 00:00:02,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727823238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:02,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:02,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-11-10 00:00:02,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689608230] [2024-11-10 00:00:02,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:02,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 00:00:02,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:02,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 00:00:02,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2024-11-10 00:00:02,067 INFO L87 Difference]: Start difference. First operand 706 states and 1001 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:03,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:03,978 INFO L93 Difference]: Finished difference Result 2731 states and 3964 transitions. [2024-11-10 00:00:03,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 00:00:03,979 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-10 00:00:03,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:03,988 INFO L225 Difference]: With dead ends: 2731 [2024-11-10 00:00:03,988 INFO L226 Difference]: Without dead ends: 2505 [2024-11-10 00:00:03,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=363, Invalid=1359, Unknown=0, NotChecked=0, Total=1722 [2024-11-10 00:00:03,990 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 1365 mSDsluCounter, 2798 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1365 SdHoareTripleChecker+Valid, 3074 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:03,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1365 Valid, 3074 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 00:00:03,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2024-11-10 00:00:04,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 701. [2024-11-10 00:00:04,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 700 states have (on average 1.42) internal successors, (994), 700 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:04,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 994 transitions. [2024-11-10 00:00:04,016 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 994 transitions. Word has length 71 [2024-11-10 00:00:04,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:04,016 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 994 transitions. [2024-11-10 00:00:04,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 994 transitions. [2024-11-10 00:00:04,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-10 00:00:04,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:04,017 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] [2024-11-10 00:00:04,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:00:04,018 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:04,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:04,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1203624226, now seen corresponding path program 1 times [2024-11-10 00:00:04,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:04,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540267272] [2024-11-10 00:00:04,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:04,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:04,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:04,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:04,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540267272] [2024-11-10 00:00:04,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540267272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:04,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:04,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 00:00:04,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879090838] [2024-11-10 00:00:04,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:04,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 00:00:04,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:04,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 00:00:04,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:00:04,537 INFO L87 Difference]: Start difference. First operand 701 states and 994 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:05,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:05,087 INFO L93 Difference]: Finished difference Result 1520 states and 2193 transitions. [2024-11-10 00:00:05,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 00:00:05,087 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2024-11-10 00:00:05,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:05,090 INFO L225 Difference]: With dead ends: 1520 [2024-11-10 00:00:05,091 INFO L226 Difference]: Without dead ends: 1289 [2024-11-10 00:00:05,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-11-10 00:00:05,092 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 820 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:05,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 992 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:00:05,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2024-11-10 00:00:05,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 675. [2024-11-10 00:00:05,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 674 states have (on average 1.4228486646884273) internal successors, (959), 674 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:05,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 959 transitions. [2024-11-10 00:00:05,111 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 959 transitions. Word has length 72 [2024-11-10 00:00:05,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:05,111 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 959 transitions. [2024-11-10 00:00:05,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:05,111 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 959 transitions. [2024-11-10 00:00:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-10 00:00:05,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:05,112 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] [2024-11-10 00:00:05,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:00:05,114 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:05,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:05,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1648194554, now seen corresponding path program 1 times [2024-11-10 00:00:05,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:05,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357694062] [2024-11-10 00:00:05,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:05,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:05,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:05,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:05,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357694062] [2024-11-10 00:00:05,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357694062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:05,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:05,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 00:00:05,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370173555] [2024-11-10 00:00:05,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:05,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 00:00:05,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:05,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 00:00:05,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:00:05,567 INFO L87 Difference]: Start difference. First operand 675 states and 959 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:05,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:05,877 INFO L93 Difference]: Finished difference Result 1475 states and 2133 transitions. [2024-11-10 00:00:05,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 00:00:05,878 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2024-11-10 00:00:05,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:05,881 INFO L225 Difference]: With dead ends: 1475 [2024-11-10 00:00:05,881 INFO L226 Difference]: Without dead ends: 1240 [2024-11-10 00:00:05,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-10 00:00:05,883 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 841 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:05,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 604 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:00:05,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2024-11-10 00:00:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 654. [2024-11-10 00:00:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 653 states have (on average 1.4287901990811638) internal successors, (933), 653 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:05,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 933 transitions. [2024-11-10 00:00:05,906 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 933 transitions. Word has length 72 [2024-11-10 00:00:05,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:05,906 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 933 transitions. [2024-11-10 00:00:05,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:05,906 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 933 transitions. [2024-11-10 00:00:05,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 00:00:05,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:05,907 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] [2024-11-10 00:00:05,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:00:05,907 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:05,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:05,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1632404499, now seen corresponding path program 1 times [2024-11-10 00:00:05,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:05,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178002150] [2024-11-10 00:00:05,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:05,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:06,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:06,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178002150] [2024-11-10 00:00:06,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178002150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:06,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:06,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 00:00:06,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710643096] [2024-11-10 00:00:06,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:06,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 00:00:06,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:06,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 00:00:06,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:00:06,479 INFO L87 Difference]: Start difference. First operand 654 states and 933 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:07,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:07,040 INFO L93 Difference]: Finished difference Result 1459 states and 2114 transitions. [2024-11-10 00:00:07,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 00:00:07,041 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-10 00:00:07,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:07,044 INFO L225 Difference]: With dead ends: 1459 [2024-11-10 00:00:07,044 INFO L226 Difference]: Without dead ends: 1244 [2024-11-10 00:00:07,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-11-10 00:00:07,046 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 656 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:07,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 1277 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:00:07,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2024-11-10 00:00:07,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 653. [2024-11-10 00:00:07,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 652 states have (on average 1.427914110429448) internal successors, (931), 652 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:07,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 931 transitions. [2024-11-10 00:00:07,068 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 931 transitions. Word has length 73 [2024-11-10 00:00:07,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:07,069 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 931 transitions. [2024-11-10 00:00:07,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:07,069 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 931 transitions. [2024-11-10 00:00:07,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-10 00:00:07,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:07,070 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] [2024-11-10 00:00:07,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:00:07,070 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:07,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:07,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1453642062, now seen corresponding path program 1 times [2024-11-10 00:00:07,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:07,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417565702] [2024-11-10 00:00:07,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:07,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:07,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:07,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:07,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417565702] [2024-11-10 00:00:07,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417565702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:07,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:07,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:00:07,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167464342] [2024-11-10 00:00:07,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:07,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:00:07,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:07,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:00:07,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:00:07,128 INFO L87 Difference]: Start difference. First operand 653 states and 931 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:07,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:07,152 INFO L93 Difference]: Finished difference Result 1742 states and 2520 transitions. [2024-11-10 00:00:07,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:00:07,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-11-10 00:00:07,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:07,156 INFO L225 Difference]: With dead ends: 1742 [2024-11-10 00:00:07,156 INFO L226 Difference]: Without dead ends: 1157 [2024-11-10 00:00:07,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:00:07,158 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 66 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:07,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 290 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:00:07,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-11-10 00:00:07,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1133. [2024-11-10 00:00:07,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1132 states have (on average 1.417844522968198) internal successors, (1605), 1132 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:07,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1605 transitions. [2024-11-10 00:00:07,179 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1605 transitions. Word has length 74 [2024-11-10 00:00:07,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:07,179 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1605 transitions. [2024-11-10 00:00:07,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:07,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1605 transitions. [2024-11-10 00:00:07,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 00:00:07,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:07,181 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] [2024-11-10 00:00:07,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 00:00:07,181 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:07,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:07,181 INFO L85 PathProgramCache]: Analyzing trace with hash -939072668, now seen corresponding path program 1 times [2024-11-10 00:00:07,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:07,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143638058] [2024-11-10 00:00:07,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:07,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:07,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:07,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:07,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143638058] [2024-11-10 00:00:07,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143638058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:07,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:07,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:00:07,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950403038] [2024-11-10 00:00:07,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:07,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:00:07,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:07,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:00:07,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:00:07,300 INFO L87 Difference]: Start difference. First operand 1133 states and 1605 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:07,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:07,339 INFO L93 Difference]: Finished difference Result 2620 states and 3749 transitions. [2024-11-10 00:00:07,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:00:07,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-10 00:00:07,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:07,343 INFO L225 Difference]: With dead ends: 2620 [2024-11-10 00:00:07,343 INFO L226 Difference]: Without dead ends: 1555 [2024-11-10 00:00:07,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:00:07,345 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 74 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:07,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 360 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:00:07,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2024-11-10 00:00:07,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1544. [2024-11-10 00:00:07,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1543 states have (on average 1.4147764095917044) internal successors, (2183), 1543 states have internal predecessors, (2183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2183 transitions. [2024-11-10 00:00:07,368 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2183 transitions. Word has length 75 [2024-11-10 00:00:07,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:07,368 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 2183 transitions. [2024-11-10 00:00:07,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:07,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2183 transitions. [2024-11-10 00:00:07,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 00:00:07,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:07,369 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] [2024-11-10 00:00:07,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 00:00:07,369 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:07,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:07,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1590237671, now seen corresponding path program 1 times [2024-11-10 00:00:07,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:07,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850966881] [2024-11-10 00:00:07,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:07,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:07,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:07,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:07,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850966881] [2024-11-10 00:00:07,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850966881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:07,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:07,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:00:07,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315307564] [2024-11-10 00:00:07,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:07,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:00:07,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:07,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:00:07,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:00:07,554 INFO L87 Difference]: Start difference. First operand 1544 states and 2183 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:07,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:07,580 INFO L93 Difference]: Finished difference Result 1566 states and 2209 transitions. [2024-11-10 00:00:07,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:00:07,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-10 00:00:07,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:07,583 INFO L225 Difference]: With dead ends: 1566 [2024-11-10 00:00:07,583 INFO L226 Difference]: Without dead ends: 1564 [2024-11-10 00:00:07,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:00:07,584 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:07,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 589 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:00:07,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2024-11-10 00:00:07,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1564. [2024-11-10 00:00:07,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1563 states have (on average 1.4024312220089572) internal successors, (2192), 1563 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2192 transitions. [2024-11-10 00:00:07,604 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2192 transitions. Word has length 75 [2024-11-10 00:00:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:07,605 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 2192 transitions. [2024-11-10 00:00:07,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:07,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2192 transitions. [2024-11-10 00:00:07,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 00:00:07,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:07,607 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:00:07,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 00:00:07,607 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:07,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:07,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1041949213, now seen corresponding path program 1 times [2024-11-10 00:00:07,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:07,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995805343] [2024-11-10 00:00:07,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:07,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:07,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:07,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:07,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995805343] [2024-11-10 00:00:07,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995805343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:07,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:07,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:00:07,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374046911] [2024-11-10 00:00:07,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:07,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:00:07,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:07,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:00:07,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:00:07,737 INFO L87 Difference]: Start difference. First operand 1564 states and 2192 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 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 00:00:08,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:08,018 INFO L93 Difference]: Finished difference Result 4975 states and 7115 transitions. [2024-11-10 00:00:08,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:00:08,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 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 100 [2024-11-10 00:00:08,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:08,024 INFO L225 Difference]: With dead ends: 4975 [2024-11-10 00:00:08,024 INFO L226 Difference]: Without dead ends: 3479 [2024-11-10 00:00:08,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:00:08,028 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 667 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:08,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 354 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:00:08,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2024-11-10 00:00:08,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 2459. [2024-11-10 00:00:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 2458 states have (on average 1.405207485760781) internal successors, (3454), 2458 states have internal predecessors, (3454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:08,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 3454 transitions. [2024-11-10 00:00:08,073 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 3454 transitions. Word has length 100 [2024-11-10 00:00:08,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:08,073 INFO L471 AbstractCegarLoop]: Abstraction has 2459 states and 3454 transitions. [2024-11-10 00:00:08,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 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 00:00:08,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 3454 transitions. [2024-11-10 00:00:08,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 00:00:08,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:08,075 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:00:08,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 00:00:08,075 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:08,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:08,076 INFO L85 PathProgramCache]: Analyzing trace with hash -812537123, now seen corresponding path program 1 times [2024-11-10 00:00:08,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:08,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546774095] [2024-11-10 00:00:08,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:08,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:08,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:08,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:08,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546774095] [2024-11-10 00:00:08,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546774095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:08,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:08,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:00:08,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617262509] [2024-11-10 00:00:08,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:08,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:00:08,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:08,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:00:08,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:00:08,200 INFO L87 Difference]: Start difference. First operand 2459 states and 3454 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 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 00:00:08,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:08,445 INFO L93 Difference]: Finished difference Result 8879 states and 12688 transitions. [2024-11-10 00:00:08,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:00:08,446 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 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 100 [2024-11-10 00:00:08,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:08,459 INFO L225 Difference]: With dead ends: 8879 [2024-11-10 00:00:08,459 INFO L226 Difference]: Without dead ends: 6509 [2024-11-10 00:00:08,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:00:08,467 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 819 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:08,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 285 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:00:08,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6509 states. [2024-11-10 00:00:08,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6509 to 5247. [2024-11-10 00:00:08,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5247 states, 5246 states have (on average 1.410217308425467) internal successors, (7398), 5246 states have internal predecessors, (7398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:08,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5247 states to 5247 states and 7398 transitions. [2024-11-10 00:00:08,564 INFO L78 Accepts]: Start accepts. Automaton has 5247 states and 7398 transitions. Word has length 100 [2024-11-10 00:00:08,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:08,564 INFO L471 AbstractCegarLoop]: Abstraction has 5247 states and 7398 transitions. [2024-11-10 00:00:08,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 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 00:00:08,564 INFO L276 IsEmpty]: Start isEmpty. Operand 5247 states and 7398 transitions. [2024-11-10 00:00:08,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 00:00:08,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:08,566 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:00:08,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 00:00:08,566 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:08,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:08,567 INFO L85 PathProgramCache]: Analyzing trace with hash 729965740, now seen corresponding path program 1 times [2024-11-10 00:00:08,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:08,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707264515] [2024-11-10 00:00:08,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:08,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:08,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:08,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707264515] [2024-11-10 00:00:08,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707264515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:08,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:08,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:00:08,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570577028] [2024-11-10 00:00:08,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:08,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:00:08,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:08,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:00:08,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:00:08,708 INFO L87 Difference]: Start difference. First operand 5247 states and 7398 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:08,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:08,923 INFO L93 Difference]: Finished difference Result 13851 states and 19510 transitions. [2024-11-10 00:00:08,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:00:08,924 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-11-10 00:00:08,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:08,945 INFO L225 Difference]: With dead ends: 13851 [2024-11-10 00:00:08,945 INFO L226 Difference]: Without dead ends: 9605 [2024-11-10 00:00:08,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-10 00:00:08,955 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 708 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:08,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 257 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:00:08,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9605 states. [2024-11-10 00:00:09,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9605 to 6665. [2024-11-10 00:00:09,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6665 states, 6664 states have (on average 1.381452581032413) internal successors, (9206), 6664 states have internal predecessors, (9206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:09,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 9206 transitions. [2024-11-10 00:00:09,131 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 9206 transitions. Word has length 101 [2024-11-10 00:00:09,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:09,131 INFO L471 AbstractCegarLoop]: Abstraction has 6665 states and 9206 transitions. [2024-11-10 00:00:09,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:09,132 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 9206 transitions. [2024-11-10 00:00:09,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 00:00:09,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:09,133 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:00:09,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 00:00:09,134 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:09,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:09,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1006764217, now seen corresponding path program 1 times [2024-11-10 00:00:09,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:09,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890859612] [2024-11-10 00:00:09,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:09,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:09,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:09,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:09,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890859612] [2024-11-10 00:00:09,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890859612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:09,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:09,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:00:09,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839456189] [2024-11-10 00:00:09,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:09,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:00:09,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:09,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:00:09,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:00:09,297 INFO L87 Difference]: Start difference. First operand 6665 states and 9206 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:09,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:09,553 INFO L93 Difference]: Finished difference Result 21497 states and 29944 transitions. [2024-11-10 00:00:09,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:00:09,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-11-10 00:00:09,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:09,584 INFO L225 Difference]: With dead ends: 21497 [2024-11-10 00:00:09,585 INFO L226 Difference]: Without dead ends: 14921 [2024-11-10 00:00:09,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:00:09,598 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 734 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:09,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 283 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:00:09,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14921 states. [2024-11-10 00:00:09,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14921 to 14079. [2024-11-10 00:00:09,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14079 states, 14078 states have (on average 1.384429606478193) internal successors, (19490), 14078 states have internal predecessors, (19490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:09,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14079 states to 14079 states and 19490 transitions. [2024-11-10 00:00:09,855 INFO L78 Accepts]: Start accepts. Automaton has 14079 states and 19490 transitions. Word has length 101 [2024-11-10 00:00:09,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:09,856 INFO L471 AbstractCegarLoop]: Abstraction has 14079 states and 19490 transitions. [2024-11-10 00:00:09,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:09,856 INFO L276 IsEmpty]: Start isEmpty. Operand 14079 states and 19490 transitions. [2024-11-10 00:00:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-10 00:00:09,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:09,858 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:00:09,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 00:00:09,858 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:09,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:09,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1132177621, now seen corresponding path program 1 times [2024-11-10 00:00:09,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:09,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479723135] [2024-11-10 00:00:09,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:09,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:09,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:09,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479723135] [2024-11-10 00:00:09,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479723135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:09,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:09,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:00:09,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944136054] [2024-11-10 00:00:09,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:09,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:00:09,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:09,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:00:10,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:00:10,016 INFO L87 Difference]: Start difference. First operand 14079 states and 19490 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:10,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:10,095 INFO L93 Difference]: Finished difference Result 24943 states and 34540 transitions. [2024-11-10 00:00:10,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:00:10,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2024-11-10 00:00:10,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:10,125 INFO L225 Difference]: With dead ends: 24943 [2024-11-10 00:00:10,126 INFO L226 Difference]: Without dead ends: 13376 [2024-11-10 00:00:10,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:00:10,148 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 65 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:10,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 326 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:00:10,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13376 states. [2024-11-10 00:00:10,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13376 to 12474. [2024-11-10 00:00:10,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12474 states, 12473 states have (on average 1.377375130281408) internal successors, (17180), 12473 states have internal predecessors, (17180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:10,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12474 states to 12474 states and 17180 transitions. [2024-11-10 00:00:10,342 INFO L78 Accepts]: Start accepts. Automaton has 12474 states and 17180 transitions. Word has length 103 [2024-11-10 00:00:10,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:10,342 INFO L471 AbstractCegarLoop]: Abstraction has 12474 states and 17180 transitions. [2024-11-10 00:00:10,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:10,343 INFO L276 IsEmpty]: Start isEmpty. Operand 12474 states and 17180 transitions. [2024-11-10 00:00:10,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 00:00:10,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:10,346 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:00:10,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 00:00:10,346 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:10,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:10,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1992170609, now seen corresponding path program 1 times [2024-11-10 00:00:10,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:10,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901211197] [2024-11-10 00:00:10,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:10,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 00:00:10,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:10,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901211197] [2024-11-10 00:00:10,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901211197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:10,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:10,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:00:10,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166155600] [2024-11-10 00:00:10,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:10,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:00:10,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:10,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:00:10,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:00:10,484 INFO L87 Difference]: Start difference. First operand 12474 states and 17180 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:10,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:10,555 INFO L93 Difference]: Finished difference Result 23854 states and 32754 transitions. [2024-11-10 00:00:10,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:00:10,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 128 [2024-11-10 00:00:10,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:10,582 INFO L225 Difference]: With dead ends: 23854 [2024-11-10 00:00:10,583 INFO L226 Difference]: Without dead ends: 11468 [2024-11-10 00:00:10,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:00:10,600 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 54 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:10,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 314 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:00:10,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11468 states. [2024-11-10 00:00:10,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11468 to 8748. [2024-11-10 00:00:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8748 states, 8747 states have (on average 1.3509774779924546) internal successors, (11817), 8747 states have internal predecessors, (11817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8748 states to 8748 states and 11817 transitions. [2024-11-10 00:00:10,757 INFO L78 Accepts]: Start accepts. Automaton has 8748 states and 11817 transitions. Word has length 128 [2024-11-10 00:00:10,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:10,757 INFO L471 AbstractCegarLoop]: Abstraction has 8748 states and 11817 transitions. [2024-11-10 00:00:10,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:10,757 INFO L276 IsEmpty]: Start isEmpty. Operand 8748 states and 11817 transitions. [2024-11-10 00:00:10,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 00:00:10,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:10,760 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:00:10,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 00:00:10,760 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:10,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:10,761 INFO L85 PathProgramCache]: Analyzing trace with hash -963180613, now seen corresponding path program 1 times [2024-11-10 00:00:10,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:10,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35833278] [2024-11-10 00:00:10,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:10,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:10,915 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-10 00:00:10,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:10,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35833278] [2024-11-10 00:00:10,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35833278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:10,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:10,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:00:10,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861817173] [2024-11-10 00:00:10,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:10,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:00:10,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:10,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:00:10,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:00:10,917 INFO L87 Difference]: Start difference. First operand 8748 states and 11817 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:10,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:10,971 INFO L93 Difference]: Finished difference Result 19282 states and 25997 transitions. [2024-11-10 00:00:10,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:00:10,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 128 [2024-11-10 00:00:10,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:10,994 INFO L225 Difference]: With dead ends: 19282 [2024-11-10 00:00:10,995 INFO L226 Difference]: Without dead ends: 10619 [2024-11-10 00:00:11,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:00:11,012 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 61 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:11,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 313 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:00:11,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10619 states. [2024-11-10 00:00:11,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10619 to 10179. [2024-11-10 00:00:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10179 states, 10178 states have (on average 1.3377873845549224) internal successors, (13616), 10178 states have internal predecessors, (13616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:11,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10179 states to 10179 states and 13616 transitions. [2024-11-10 00:00:11,142 INFO L78 Accepts]: Start accepts. Automaton has 10179 states and 13616 transitions. Word has length 128 [2024-11-10 00:00:11,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:11,143 INFO L471 AbstractCegarLoop]: Abstraction has 10179 states and 13616 transitions. [2024-11-10 00:00:11,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:11,143 INFO L276 IsEmpty]: Start isEmpty. Operand 10179 states and 13616 transitions. [2024-11-10 00:00:11,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 00:00:11,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:11,150 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:00:11,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 00:00:11,150 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:11,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:11,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1512417264, now seen corresponding path program 1 times [2024-11-10 00:00:11,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:11,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639263527] [2024-11-10 00:00:11,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:11,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:11,271 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:00:11,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:11,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639263527] [2024-11-10 00:00:11,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639263527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:11,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:11,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:00:11,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654383201] [2024-11-10 00:00:11,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:11,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:00:11,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:11,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:00:11,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:00:11,275 INFO L87 Difference]: Start difference. First operand 10179 states and 13616 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:11,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:11,345 INFO L93 Difference]: Finished difference Result 26023 states and 34794 transitions. [2024-11-10 00:00:11,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:00:11,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 129 [2024-11-10 00:00:11,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:11,376 INFO L225 Difference]: With dead ends: 26023 [2024-11-10 00:00:11,376 INFO L226 Difference]: Without dead ends: 15923 [2024-11-10 00:00:11,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:00:11,396 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 45 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:11,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 320 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:00:11,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15923 states. [2024-11-10 00:00:11,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15923 to 14745. [2024-11-10 00:00:11,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14745 states, 14744 states have (on average 1.3279978296256105) internal successors, (19580), 14744 states have internal predecessors, (19580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:11,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14745 states to 14745 states and 19580 transitions. [2024-11-10 00:00:11,680 INFO L78 Accepts]: Start accepts. Automaton has 14745 states and 19580 transitions. Word has length 129 [2024-11-10 00:00:11,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:11,680 INFO L471 AbstractCegarLoop]: Abstraction has 14745 states and 19580 transitions. [2024-11-10 00:00:11,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:11,681 INFO L276 IsEmpty]: Start isEmpty. Operand 14745 states and 19580 transitions. [2024-11-10 00:00:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 00:00:11,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:11,684 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:00:11,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-10 00:00:11,685 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:11,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:11,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1931982334, now seen corresponding path program 1 times [2024-11-10 00:00:11,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:11,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594078036] [2024-11-10 00:00:11,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:11,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:11,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:11,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594078036] [2024-11-10 00:00:11,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594078036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:11,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:11,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:00:11,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318191256] [2024-11-10 00:00:11,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:11,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:00:11,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:11,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:00:11,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:00:11,794 INFO L87 Difference]: Start difference. First operand 14745 states and 19580 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:11,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:11,873 INFO L93 Difference]: Finished difference Result 25908 states and 34274 transitions. [2024-11-10 00:00:11,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:00:11,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-11-10 00:00:11,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:11,892 INFO L225 Difference]: With dead ends: 25908 [2024-11-10 00:00:11,892 INFO L226 Difference]: Without dead ends: 11242 [2024-11-10 00:00:11,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:00:11,908 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 69 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:11,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 302 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:00:11,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11242 states. [2024-11-10 00:00:12,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11242 to 11032. [2024-11-10 00:00:12,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11032 states, 11031 states have (on average 1.3009699936542471) internal successors, (14351), 11031 states have internal predecessors, (14351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11032 states to 11032 states and 14351 transitions. [2024-11-10 00:00:12,065 INFO L78 Accepts]: Start accepts. Automaton has 11032 states and 14351 transitions. Word has length 130 [2024-11-10 00:00:12,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:12,065 INFO L471 AbstractCegarLoop]: Abstraction has 11032 states and 14351 transitions. [2024-11-10 00:00:12,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:12,066 INFO L276 IsEmpty]: Start isEmpty. Operand 11032 states and 14351 transitions. [2024-11-10 00:00:12,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 00:00:12,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:12,068 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:00:12,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-10 00:00:12,069 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:12,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:12,069 INFO L85 PathProgramCache]: Analyzing trace with hash -701921301, now seen corresponding path program 1 times [2024-11-10 00:00:12,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:12,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401639894] [2024-11-10 00:00:12,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:12,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:12,750 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:12,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:12,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401639894] [2024-11-10 00:00:12,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401639894] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:00:12,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040199180] [2024-11-10 00:00:12,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:12,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:00:12,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:00:12,754 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:00:12,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 00:00:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:12,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 00:00:12,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:00:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:13,981 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:00:15,675 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:15,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040199180] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:00:15,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:00:15,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 32 [2024-11-10 00:00:15,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887240650] [2024-11-10 00:00:15,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:00:15,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-10 00:00:15,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:15,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-10 00:00:15,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 00:00:15,679 INFO L87 Difference]: Start difference. First operand 11032 states and 14351 transitions. Second operand has 33 states, 33 states have (on average 11.363636363636363) internal successors, (375), 32 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:22,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:22,104 INFO L93 Difference]: Finished difference Result 109913 states and 144275 transitions. [2024-11-10 00:00:22,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-11-10 00:00:22,105 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 11.363636363636363) internal successors, (375), 32 states have internal predecessors, (375), 0 states have call successors, (0), 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 131 [2024-11-10 00:00:22,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:22,272 INFO L225 Difference]: With dead ends: 109913 [2024-11-10 00:00:22,273 INFO L226 Difference]: Without dead ends: 98995 [2024-11-10 00:00:22,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5690 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=3374, Invalid=16648, Unknown=0, NotChecked=0, Total=20022 [2024-11-10 00:00:22,324 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 3339 mSDsluCounter, 2123 mSDsCounter, 0 mSdLazyCounter, 2682 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3339 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 2778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:22,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3339 Valid, 2272 Invalid, 2778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2682 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 00:00:22,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98995 states. [2024-11-10 00:00:23,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98995 to 63588. [2024-11-10 00:00:23,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63588 states, 63587 states have (on average 1.3041030399295452) internal successors, (82924), 63587 states have internal predecessors, (82924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63588 states to 63588 states and 82924 transitions. [2024-11-10 00:00:23,887 INFO L78 Accepts]: Start accepts. Automaton has 63588 states and 82924 transitions. Word has length 131 [2024-11-10 00:00:23,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:23,888 INFO L471 AbstractCegarLoop]: Abstraction has 63588 states and 82924 transitions. [2024-11-10 00:00:23,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 11.363636363636363) internal successors, (375), 32 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:23,888 INFO L276 IsEmpty]: Start isEmpty. Operand 63588 states and 82924 transitions. [2024-11-10 00:00:23,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 00:00:23,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:23,897 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:00:23,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 00:00:24,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-10 00:00:24,102 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:24,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:24,103 INFO L85 PathProgramCache]: Analyzing trace with hash -620138805, now seen corresponding path program 1 times [2024-11-10 00:00:24,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:24,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382449701] [2024-11-10 00:00:24,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:24,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:24,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:24,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382449701] [2024-11-10 00:00:24,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382449701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:00:24,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517794988] [2024-11-10 00:00:24,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:24,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:00:24,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:00:24,907 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:00:24,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 00:00:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:25,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 00:00:25,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:00:26,443 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:26,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:00:28,474 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:28,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517794988] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:00:28,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:00:28,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 18] total 46 [2024-11-10 00:00:28,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293675290] [2024-11-10 00:00:28,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:00:28,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-10 00:00:28,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:28,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-10 00:00:28,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1928, Unknown=0, NotChecked=0, Total=2070 [2024-11-10 00:00:28,477 INFO L87 Difference]: Start difference. First operand 63588 states and 82924 transitions. Second operand has 46 states, 46 states have (on average 7.978260869565218) internal successors, (367), 46 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)