/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-84.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:35:21,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:35:21,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:35:21,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:35:21,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:35:22,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:35:22,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:35:22,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:35:22,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:35:22,010 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:35:22,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:35:22,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:35:22,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:35:22,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:35:22,011 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:35:22,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:35:22,012 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:35:22,012 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:35:22,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:35:22,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:35:22,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:35:22,013 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:35:22,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:35:22,014 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:35:22,014 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:35:22,014 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:35:22,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:35:22,015 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:35:22,015 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:35:22,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:35:22,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:35:22,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:35:22,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:35:22,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:35:22,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:35:22,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:35:22,017 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:35:22,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:35:22,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:35:22,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:35:22,018 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:35:22,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:35:22,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:35:22,018 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: Use bitabs translation -> true [2023-12-15 21:35:22,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:35:22,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:35:22,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:35:22,217 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:35:22,218 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:35:22,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-84.i [2023-12-15 21:35:23,299 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:35:23,491 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:35:23,492 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-84.i [2023-12-15 21:35:23,499 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b7ef3735/9d23358f05654908889c8d81a7b6ded7/FLAG82b50072e [2023-12-15 21:35:23,510 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b7ef3735/9d23358f05654908889c8d81a7b6ded7 [2023-12-15 21:35:23,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:35:23,514 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:35:23,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:35:23,514 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:35:23,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:35:23,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:35:23" (1/1) ... [2023-12-15 21:35:23,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59168845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:23, skipping insertion in model container [2023-12-15 21:35:23,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:35:23" (1/1) ... [2023-12-15 21:35:23,548 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:35:23,634 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-84.i[917,930] [2023-12-15 21:35:23,678 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:35:23,686 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:35:23,694 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-84.i[917,930] [2023-12-15 21:35:23,718 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:35:23,734 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:35:23,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:23 WrapperNode [2023-12-15 21:35:23,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:35:23,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:35:23,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:35:23,736 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:35:23,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:23" (1/1) ... [2023-12-15 21:35:23,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:23" (1/1) ... [2023-12-15 21:35:23,784 INFO L138 Inliner]: procedures = 29, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 445 [2023-12-15 21:35:23,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:35:23,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:35:23,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:35:23,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:35:23,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:23" (1/1) ... [2023-12-15 21:35:23,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:23" (1/1) ... [2023-12-15 21:35:23,798 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:23" (1/1) ... [2023-12-15 21:35:23,833 INFO L175 MemorySlicer]: Split 122 memory accesses to 6 slices as follows [2, 6, 11, 19, 72, 12]. 59 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 2, 3, 7, 2]. The 17 writes are split as follows [0, 1, 2, 4, 8, 2]. [2023-12-15 21:35:23,834 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:23" (1/1) ... [2023-12-15 21:35:23,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:23" (1/1) ... [2023-12-15 21:35:23,869 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:23" (1/1) ... [2023-12-15 21:35:23,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:23" (1/1) ... [2023-12-15 21:35:23,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:23" (1/1) ... [2023-12-15 21:35:23,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:23" (1/1) ... [2023-12-15 21:35:23,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:35:23,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:35:23,880 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:35:23,880 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:35:23,881 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:23" (1/1) ... [2023-12-15 21:35:23,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:35:23,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:35:23,929 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) [2023-12-15 21:35:23,987 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 [2023-12-15 21:35:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:35:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-15 21:35:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-15 21:35:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-15 21:35:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-15 21:35:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-15 21:35:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-15 21:35:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:35:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:35:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 21:35:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-15 21:35:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-15 21:35:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-15 21:35:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-15 21:35:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-15 21:35:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-15 21:35:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-15 21:35:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-15 21:35:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-15 21:35:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:35:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:35:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-15 21:35:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-15 21:35:24,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-15 21:35:24,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-15 21:35:24,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-15 21:35:24,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-15 21:35:24,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-15 21:35:24,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-15 21:35:24,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-15 21:35:24,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-15 21:35:24,010 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:35:24,011 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:35:24,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:35:24,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:35:24,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 21:35:24,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 21:35:24,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-15 21:35:24,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-15 21:35:24,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:35:24,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:35:24,127 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:35:24,129 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:35:24,430 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:35:24,452 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:35:24,452 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:35:24,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:35:24 BoogieIcfgContainer [2023-12-15 21:35:24,453 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:35:24,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:35:24,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:35:24,456 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:35:24,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:35:23" (1/3) ... [2023-12-15 21:35:24,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670564d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:35:24, skipping insertion in model container [2023-12-15 21:35:24,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:23" (2/3) ... [2023-12-15 21:35:24,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670564d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:35:24, skipping insertion in model container [2023-12-15 21:35:24,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:35:24" (3/3) ... [2023-12-15 21:35:24,458 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-84.i [2023-12-15 21:35:24,470 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:35:24,470 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:35:24,503 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:35:24,507 INFO L357 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, mHoare=true, 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;@336fe89f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:35:24,507 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:35:24,510 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:35:24,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-15 21:35:24,520 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:35:24,520 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:35:24,521 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:35:24,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:35:24,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1796415869, now seen corresponding path program 1 times [2023-12-15 21:35:24,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:35:24,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54185138] [2023-12-15 21:35:24,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:35:24,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:35:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:24,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:35:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:24,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:35:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:24,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:35:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:24,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:35:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:24,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:35:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:24,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:35:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:24,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:35:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:24,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:35:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:24,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:35:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:24,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:35:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:24,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:35:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:24,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:35:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:24,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:35:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:24,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:35:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:24,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:35:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:24,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:35:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:24,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:35:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:24,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:35:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:24,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:35:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:24,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:35:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:35:24,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:35:24,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54185138] [2023-12-15 21:35:24,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54185138] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:35:24,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:35:24,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:35:24,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480108714] [2023-12-15 21:35:24,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:35:24,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:35:24,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:35:24,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:35:24,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:35:24,974 INFO L87 Difference]: Start difference. First operand has 96 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-15 21:35:25,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:35:25,026 INFO L93 Difference]: Finished difference Result 189 states and 300 transitions. [2023-12-15 21:35:25,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:35:25,028 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 145 [2023-12-15 21:35:25,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:35:25,036 INFO L225 Difference]: With dead ends: 189 [2023-12-15 21:35:25,037 INFO L226 Difference]: Without dead ends: 94 [2023-12-15 21:35:25,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:35:25,043 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:35:25,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:35:25,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-15 21:35:25,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-12-15 21:35:25,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:35:25,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2023-12-15 21:35:25,084 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 145 [2023-12-15 21:35:25,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:35:25,085 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2023-12-15 21:35:25,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-15 21:35:25,085 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2023-12-15 21:35:25,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-15 21:35:25,087 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:35:25,087 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:35:25,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:35:25,088 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:35:25,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:35:25,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1563679197, now seen corresponding path program 1 times [2023-12-15 21:35:25,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:35:25,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605499120] [2023-12-15 21:35:25,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:35:25,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:35:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:35:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:35:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:35:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:35:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:35:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:35:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:35:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:35:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:35:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:35:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:35:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:35:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:35:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:35:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:35:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:35:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:35:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:35:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:35:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:35:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,350 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:35:25,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:35:25,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605499120] [2023-12-15 21:35:25,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605499120] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:35:25,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:35:25,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:35:25,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940679238] [2023-12-15 21:35:25,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:35:25,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:35:25,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:35:25,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:35:25,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:35:25,357 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-15 21:35:25,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:35:25,418 INFO L93 Difference]: Finished difference Result 193 states and 280 transitions. [2023-12-15 21:35:25,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:35:25,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 145 [2023-12-15 21:35:25,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:35:25,420 INFO L225 Difference]: With dead ends: 193 [2023-12-15 21:35:25,421 INFO L226 Difference]: Without dead ends: 100 [2023-12-15 21:35:25,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:35:25,422 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 10 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:35:25,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 388 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:35:25,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-15 21:35:25,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2023-12-15 21:35:25,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 74 states have internal predecessors, (98), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:35:25,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2023-12-15 21:35:25,433 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 145 [2023-12-15 21:35:25,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:35:25,433 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2023-12-15 21:35:25,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-15 21:35:25,437 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2023-12-15 21:35:25,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-15 21:35:25,438 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:35:25,439 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:35:25,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:35:25,439 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:35:25,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:35:25,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2108551771, now seen corresponding path program 1 times [2023-12-15 21:35:25,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:35:25,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653647080] [2023-12-15 21:35:25,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:35:25,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:35:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:35:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:35:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:35:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:35:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:35:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:35:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:35:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:35:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:35:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:35:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:35:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:35:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:35:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:35:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:35:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:35:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:35:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:35:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:35:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:35:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,649 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:35:25,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:35:25,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653647080] [2023-12-15 21:35:25,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653647080] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:35:25,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:35:25,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:35:25,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448115043] [2023-12-15 21:35:25,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:35:25,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:35:25,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:35:25,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:35:25,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:35:25,657 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:35:25,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:35:25,702 INFO L93 Difference]: Finished difference Result 195 states and 280 transitions. [2023-12-15 21:35:25,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:35:25,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2023-12-15 21:35:25,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:35:25,706 INFO L225 Difference]: With dead ends: 195 [2023-12-15 21:35:25,706 INFO L226 Difference]: Without dead ends: 100 [2023-12-15 21:35:25,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:35:25,710 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 3 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:35:25,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 384 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:35:25,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-15 21:35:25,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2023-12-15 21:35:25,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 76 states have internal predecessors, (100), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:35:25,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2023-12-15 21:35:25,716 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 145 [2023-12-15 21:35:25,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:35:25,717 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2023-12-15 21:35:25,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:35:25,717 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2023-12-15 21:35:25,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-15 21:35:25,723 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:35:25,723 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:35:25,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:35:25,723 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:35:25,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:35:25,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2108611353, now seen corresponding path program 1 times [2023-12-15 21:35:25,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:35:25,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824772746] [2023-12-15 21:35:25,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:35:25,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:35:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:35:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:35:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:35:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:35:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:35:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:35:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:35:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:35:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:35:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:35:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:35:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:35:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:35:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:25,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:35:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:26,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:35:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:26,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:35:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:26,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:35:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:26,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:35:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:26,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:35:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:26,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:35:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:26,038 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:35:26,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:35:26,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824772746] [2023-12-15 21:35:26,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824772746] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:35:26,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:35:26,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:35:26,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266954096] [2023-12-15 21:35:26,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:35:26,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:35:26,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:35:26,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:35:26,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:35:26,056 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-15 21:35:26,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:35:26,253 INFO L93 Difference]: Finished difference Result 295 states and 422 transitions. [2023-12-15 21:35:26,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:35:26,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 145 [2023-12-15 21:35:26,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:35:26,257 INFO L225 Difference]: With dead ends: 295 [2023-12-15 21:35:26,257 INFO L226 Difference]: Without dead ends: 198 [2023-12-15 21:35:26,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:35:26,261 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 195 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:35:26,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 535 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:35:26,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-12-15 21:35:26,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 166. [2023-12-15 21:35:26,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 123 states have internal predecessors, (157), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 21:35:26,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 237 transitions. [2023-12-15 21:35:26,290 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 237 transitions. Word has length 145 [2023-12-15 21:35:26,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:35:26,290 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 237 transitions. [2023-12-15 21:35:26,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-15 21:35:26,290 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 237 transitions. [2023-12-15 21:35:26,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-15 21:35:26,291 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:35:26,292 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:35:26,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:35:26,292 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:35:26,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:35:26,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1741469637, now seen corresponding path program 1 times [2023-12-15 21:35:26,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:35:26,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498719715] [2023-12-15 21:35:26,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:35:26,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:35:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:47,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:35:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:47,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:35:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:47,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:35:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:47,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:35:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:47,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:35:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:47,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:35:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:47,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:35:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:47,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:35:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:47,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:35:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:47,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:35:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:47,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:35:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:47,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:35:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:47,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:35:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:47,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:35:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:47,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:35:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:47,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:35:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:47,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:35:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:47,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:35:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:47,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:35:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:47,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:35:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:47,573 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:35:47,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:35:47,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498719715] [2023-12-15 21:35:47,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498719715] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:35:47,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:35:47,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-15 21:35:47,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270347622] [2023-12-15 21:35:47,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:35:47,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-15 21:35:47,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:35:47,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-15 21:35:47,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2023-12-15 21:35:47,577 INFO L87 Difference]: Start difference. First operand 166 states and 237 transitions. Second operand has 18 states, 16 states have (on average 3.5) internal successors, (56), 18 states have internal predecessors, (56), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) [2023-12-15 21:35:51,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:35:51,171 INFO L93 Difference]: Finished difference Result 469 states and 662 transitions. [2023-12-15 21:35:51,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-15 21:35:51,172 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.5) internal successors, (56), 18 states have internal predecessors, (56), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) Word has length 153 [2023-12-15 21:35:51,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:35:51,174 INFO L225 Difference]: With dead ends: 469 [2023-12-15 21:35:51,174 INFO L226 Difference]: Without dead ends: 372 [2023-12-15 21:35:51,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=323, Invalid=1317, Unknown=0, NotChecked=0, Total=1640 [2023-12-15 21:35:51,175 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 818 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:35:51,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 1146 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-15 21:35:51,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2023-12-15 21:35:51,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 294. [2023-12-15 21:35:51,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 241 states have (on average 1.3236514522821576) internal successors, (319), 243 states have internal predecessors, (319), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-15 21:35:51,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 415 transitions. [2023-12-15 21:35:51,215 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 415 transitions. Word has length 153 [2023-12-15 21:35:51,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:35:51,216 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 415 transitions. [2023-12-15 21:35:51,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.5) internal successors, (56), 18 states have internal predecessors, (56), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) [2023-12-15 21:35:51,216 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 415 transitions. [2023-12-15 21:35:51,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 21:35:51,217 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:35:51,218 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:35:51,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:35:51,218 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:35:51,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:35:51,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1146676630, now seen corresponding path program 1 times [2023-12-15 21:35:51,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:35:51,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048049377] [2023-12-15 21:35:51,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:35:51,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:35:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:52,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:35:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:52,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:35:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:52,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:35:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:52,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:35:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:52,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:35:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:52,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:35:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:52,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:35:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:52,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:35:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:52,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:35:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:52,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:35:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:52,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:35:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:52,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:35:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:52,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:35:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:52,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:35:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:52,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:35:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:52,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:35:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:52,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:35:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:52,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:35:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:52,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:35:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:52,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:35:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:52,509 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:35:52,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:35:52,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048049377] [2023-12-15 21:35:52,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048049377] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:35:52,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:35:52,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-15 21:35:52,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517020317] [2023-12-15 21:35:52,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:35:52,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-15 21:35:52,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:35:52,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-15 21:35:52,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:35:52,513 INFO L87 Difference]: Start difference. First operand 294 states and 415 transitions. Second operand has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-15 21:35:53,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:35:53,412 INFO L93 Difference]: Finished difference Result 613 states and 860 transitions. [2023-12-15 21:35:53,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:35:53,412 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 155 [2023-12-15 21:35:53,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:35:53,415 INFO L225 Difference]: With dead ends: 613 [2023-12-15 21:35:53,415 INFO L226 Difference]: Without dead ends: 403 [2023-12-15 21:35:53,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2023-12-15 21:35:53,416 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 428 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 21:35:53,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 597 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 21:35:53,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2023-12-15 21:35:53,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 331. [2023-12-15 21:35:53,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 277 states have (on average 1.3357400722021662) internal successors, (370), 279 states have internal predecessors, (370), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-15 21:35:53,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 466 transitions. [2023-12-15 21:35:53,439 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 466 transitions. Word has length 155 [2023-12-15 21:35:53,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:35:53,439 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 466 transitions. [2023-12-15 21:35:53,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-15 21:35:53,439 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 466 transitions. [2023-12-15 21:35:53,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 21:35:53,440 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:35:53,440 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:35:53,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 21:35:53,440 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:35:53,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:35:53,441 INFO L85 PathProgramCache]: Analyzing trace with hash -133187048, now seen corresponding path program 1 times [2023-12-15 21:35:53,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:35:53,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058585434] [2023-12-15 21:35:53,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:35:53,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:35:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:54,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:35:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:54,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:35:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:54,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:35:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:54,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:35:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:54,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:35:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:54,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:35:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:54,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:35:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:54,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:35:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:54,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:35:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:54,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:35:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:54,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:35:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:54,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:35:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:54,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:35:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:54,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:35:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:54,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:35:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:54,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:35:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:54,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:35:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:54,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:35:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:54,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:35:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:54,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:35:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:35:54,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:35:54,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058585434] [2023-12-15 21:35:54,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058585434] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:35:54,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:35:54,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-15 21:35:54,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854485870] [2023-12-15 21:35:54,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:35:54,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-15 21:35:54,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:35:54,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-15 21:35:54,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:35:54,943 INFO L87 Difference]: Start difference. First operand 331 states and 466 transitions. Second operand has 13 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-15 21:35:56,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:35:56,107 INFO L93 Difference]: Finished difference Result 627 states and 880 transitions. [2023-12-15 21:35:56,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:35:56,108 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 155 [2023-12-15 21:35:56,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:35:56,110 INFO L225 Difference]: With dead ends: 627 [2023-12-15 21:35:56,110 INFO L226 Difference]: Without dead ends: 398 [2023-12-15 21:35:56,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2023-12-15 21:35:56,111 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 316 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-15 21:35:56,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 870 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-15 21:35:56,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2023-12-15 21:35:56,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 329. [2023-12-15 21:35:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 275 states have (on average 1.3309090909090908) internal successors, (366), 277 states have internal predecessors, (366), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-15 21:35:56,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 462 transitions. [2023-12-15 21:35:56,135 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 462 transitions. Word has length 155 [2023-12-15 21:35:56,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:35:56,136 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 462 transitions. [2023-12-15 21:35:56,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-15 21:35:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 462 transitions. [2023-12-15 21:35:56,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 21:35:56,137 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:35:56,137 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:35:56,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 21:35:56,137 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:35:56,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:35:56,138 INFO L85 PathProgramCache]: Analyzing trace with hash -687298462, now seen corresponding path program 1 times [2023-12-15 21:35:56,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:35:56,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891200483] [2023-12-15 21:35:56,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:35:56,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:35:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:56,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:35:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:56,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:35:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:56,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:35:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:56,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:35:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:56,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:35:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:56,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:35:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:56,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:35:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:56,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:35:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:56,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:35:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:56,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:35:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:56,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:35:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:56,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:35:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:56,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:35:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:56,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:35:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:56,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:35:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:56,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:35:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:56,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:35:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:56,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:35:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:56,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:35:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:56,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:35:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:35:56,296 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:35:56,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:35:56,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891200483] [2023-12-15 21:35:56,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891200483] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:35:56,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:35:56,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:35:56,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958578466] [2023-12-15 21:35:56,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:35:56,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:35:56,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:35:56,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:35:56,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:35:56,298 INFO L87 Difference]: Start difference. First operand 329 states and 462 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:35:56,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:35:56,346 INFO L93 Difference]: Finished difference Result 604 states and 848 transitions. [2023-12-15 21:35:56,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:35:56,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2023-12-15 21:35:56,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:35:56,348 INFO L225 Difference]: With dead ends: 604 [2023-12-15 21:35:56,348 INFO L226 Difference]: Without dead ends: 377 [2023-12-15 21:35:56,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:35:56,349 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 48 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:35:56,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 518 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:35:56,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2023-12-15 21:35:56,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 338. [2023-12-15 21:35:56,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 284 states have (on average 1.3204225352112675) internal successors, (375), 286 states have internal predecessors, (375), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-15 21:35:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 471 transitions. [2023-12-15 21:35:56,375 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 471 transitions. Word has length 155 [2023-12-15 21:35:56,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:35:56,376 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 471 transitions. [2023-12-15 21:35:56,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:35:56,376 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 471 transitions. [2023-12-15 21:35:56,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 21:35:56,377 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:35:56,377 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:35:56,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 21:35:56,377 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:35:56,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:35:56,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1388363040, now seen corresponding path program 1 times [2023-12-15 21:35:56,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:35:56,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545613052] [2023-12-15 21:35:56,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:35:56,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:35:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:02,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:02,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:02,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:36:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:02,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:36:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:02,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:36:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:02,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:36:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:02,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:36:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:02,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:36:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:02,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:36:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:02,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:36:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:02,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:36:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:02,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:36:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:02,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:02,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:36:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:02,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:36:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:02,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:02,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:36:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:02,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:36:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:02,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:36:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:02,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:36:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:02,277 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:36:02,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:02,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545613052] [2023-12-15 21:36:02,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545613052] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:02,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:02,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 21:36:02,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63709238] [2023-12-15 21:36:02,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:02,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 21:36:02,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:02,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 21:36:02,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:36:02,280 INFO L87 Difference]: Start difference. First operand 338 states and 471 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-15 21:36:03,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:03,143 INFO L93 Difference]: Finished difference Result 885 states and 1231 transitions. [2023-12-15 21:36:03,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 21:36:03,144 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2023-12-15 21:36:03,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:03,147 INFO L225 Difference]: With dead ends: 885 [2023-12-15 21:36:03,147 INFO L226 Difference]: Without dead ends: 649 [2023-12-15 21:36:03,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2023-12-15 21:36:03,152 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 326 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:03,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 672 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 21:36:03,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2023-12-15 21:36:03,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 559. [2023-12-15 21:36:03,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 482 states have (on average 1.3360995850622406) internal successors, (644), 487 states have internal predecessors, (644), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 63 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-15 21:36:03,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 780 transitions. [2023-12-15 21:36:03,212 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 780 transitions. Word has length 155 [2023-12-15 21:36:03,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:03,212 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 780 transitions. [2023-12-15 21:36:03,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-15 21:36:03,212 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 780 transitions. [2023-12-15 21:36:03,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 21:36:03,214 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:03,214 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:03,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 21:36:03,214 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:03,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:03,214 INFO L85 PathProgramCache]: Analyzing trace with hash 920465846, now seen corresponding path program 1 times [2023-12-15 21:36:03,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:03,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998736474] [2023-12-15 21:36:03,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:03,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:04,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:04,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:04,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:36:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:04,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:36:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:04,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:36:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:04,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:36:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:04,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:36:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:04,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:36:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:04,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:36:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:04,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:36:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:04,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:36:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:04,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:36:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:04,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:04,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:36:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:04,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:36:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:04,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:04,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:36:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:04,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:36:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:04,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:36:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:04,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:36:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:04,171 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:36:04,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:04,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998736474] [2023-12-15 21:36:04,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998736474] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:04,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:04,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-15 21:36:04,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187174876] [2023-12-15 21:36:04,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:04,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-15 21:36:04,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:04,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-15 21:36:04,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:36:04,173 INFO L87 Difference]: Start difference. First operand 559 states and 780 transitions. Second operand has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-15 21:36:05,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:05,227 INFO L93 Difference]: Finished difference Result 1627 states and 2245 transitions. [2023-12-15 21:36:05,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 21:36:05,227 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2023-12-15 21:36:05,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:05,230 INFO L225 Difference]: With dead ends: 1627 [2023-12-15 21:36:05,230 INFO L226 Difference]: Without dead ends: 1196 [2023-12-15 21:36:05,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2023-12-15 21:36:05,232 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 640 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:05,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 777 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-15 21:36:05,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2023-12-15 21:36:05,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 625. [2023-12-15 21:36:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 548 states have (on average 1.3503649635036497) internal successors, (740), 553 states have internal predecessors, (740), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 63 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-15 21:36:05,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 876 transitions. [2023-12-15 21:36:05,275 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 876 transitions. Word has length 155 [2023-12-15 21:36:05,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:05,275 INFO L495 AbstractCegarLoop]: Abstraction has 625 states and 876 transitions. [2023-12-15 21:36:05,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-15 21:36:05,275 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 876 transitions. [2023-12-15 21:36:05,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 21:36:05,276 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:05,276 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:05,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 21:36:05,276 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:05,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:05,277 INFO L85 PathProgramCache]: Analyzing trace with hash -667882056, now seen corresponding path program 1 times [2023-12-15 21:36:05,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:05,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939660940] [2023-12-15 21:36:05,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:05,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:05,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:05,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:05,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:36:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:05,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:36:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:05,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:36:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:05,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:36:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:05,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:36:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:05,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:36:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:05,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:36:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:05,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:36:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:05,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:36:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:05,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:36:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:05,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:05,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:36:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:05,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:36:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:05,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:05,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:36:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:05,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:36:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:05,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:36:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:05,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:36:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:05,567 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:36:05,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:05,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939660940] [2023-12-15 21:36:05,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939660940] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:05,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:05,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:36:05,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946241100] [2023-12-15 21:36:05,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:05,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:36:05,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:05,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:36:05,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:36:05,569 INFO L87 Difference]: Start difference. First operand 625 states and 876 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:36:05,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:05,879 INFO L93 Difference]: Finished difference Result 1655 states and 2293 transitions. [2023-12-15 21:36:05,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:36:05,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2023-12-15 21:36:05,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:05,883 INFO L225 Difference]: With dead ends: 1655 [2023-12-15 21:36:05,883 INFO L226 Difference]: Without dead ends: 1185 [2023-12-15 21:36:05,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:36:05,885 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 140 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:05,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 568 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:36:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2023-12-15 21:36:05,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 643. [2023-12-15 21:36:05,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 566 states have (on average 1.3498233215547704) internal successors, (764), 571 states have internal predecessors, (764), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 63 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-15 21:36:05,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 900 transitions. [2023-12-15 21:36:05,938 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 900 transitions. Word has length 155 [2023-12-15 21:36:05,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:05,938 INFO L495 AbstractCegarLoop]: Abstraction has 643 states and 900 transitions. [2023-12-15 21:36:05,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:36:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 900 transitions. [2023-12-15 21:36:05,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 21:36:05,940 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:05,940 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:05,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 21:36:05,941 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:05,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:05,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1678999306, now seen corresponding path program 1 times [2023-12-15 21:36:05,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:05,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097328532] [2023-12-15 21:36:05,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:05,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:07,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:07,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:07,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:36:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:07,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:36:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:07,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:36:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:07,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:36:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:07,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:36:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:07,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:36:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:07,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:36:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:07,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:36:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:07,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:36:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:07,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:36:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:07,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:07,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:36:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:07,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:36:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:07,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:07,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:36:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:07,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:36:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:07,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:36:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:07,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:36:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:07,621 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:36:07,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:07,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097328532] [2023-12-15 21:36:07,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097328532] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:07,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:07,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-15 21:36:07,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968614886] [2023-12-15 21:36:07,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:07,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-15 21:36:07,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:07,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-15 21:36:07,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:36:07,623 INFO L87 Difference]: Start difference. First operand 643 states and 900 transitions. Second operand has 15 states, 13 states have (on average 4.461538461538462) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) [2023-12-15 21:36:09,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:09,369 INFO L93 Difference]: Finished difference Result 1538 states and 2123 transitions. [2023-12-15 21:36:09,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 21:36:09,370 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.461538461538462) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) Word has length 155 [2023-12-15 21:36:09,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:09,373 INFO L225 Difference]: With dead ends: 1538 [2023-12-15 21:36:09,373 INFO L226 Difference]: Without dead ends: 1046 [2023-12-15 21:36:09,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2023-12-15 21:36:09,374 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 528 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:09,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 836 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-15 21:36:09,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2023-12-15 21:36:09,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 643. [2023-12-15 21:36:09,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 566 states have (on average 1.3498233215547704) internal successors, (764), 571 states have internal predecessors, (764), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 63 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-15 21:36:09,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 900 transitions. [2023-12-15 21:36:09,419 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 900 transitions. Word has length 155 [2023-12-15 21:36:09,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:09,419 INFO L495 AbstractCegarLoop]: Abstraction has 643 states and 900 transitions. [2023-12-15 21:36:09,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.461538461538462) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) [2023-12-15 21:36:09,420 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 900 transitions. [2023-12-15 21:36:09,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 21:36:09,421 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:09,421 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:09,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 21:36:09,421 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:09,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:09,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1522376546, now seen corresponding path program 1 times [2023-12-15 21:36:09,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:09,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000948243] [2023-12-15 21:36:09,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:09,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:36:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:36:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:36:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:36:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:36:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:36:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:36:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:36:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:36:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:36:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:36:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:36:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:36:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:36:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:36:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:36:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,549 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:36:09,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:09,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000948243] [2023-12-15 21:36:09,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000948243] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:09,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:09,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:36:09,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212680262] [2023-12-15 21:36:09,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:09,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:36:09,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:09,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:36:09,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:36:09,551 INFO L87 Difference]: Start difference. First operand 643 states and 900 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:36:09,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:09,627 INFO L93 Difference]: Finished difference Result 1217 states and 1698 transitions. [2023-12-15 21:36:09,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:36:09,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2023-12-15 21:36:09,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:09,630 INFO L225 Difference]: With dead ends: 1217 [2023-12-15 21:36:09,630 INFO L226 Difference]: Without dead ends: 729 [2023-12-15 21:36:09,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:36:09,632 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 63 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:09,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 686 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:36:09,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2023-12-15 21:36:09,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 640. [2023-12-15 21:36:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 563 states have (on average 1.3463587921847247) internal successors, (758), 568 states have internal predecessors, (758), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 63 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-15 21:36:09,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 894 transitions. [2023-12-15 21:36:09,684 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 894 transitions. Word has length 155 [2023-12-15 21:36:09,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:09,684 INFO L495 AbstractCegarLoop]: Abstraction has 640 states and 894 transitions. [2023-12-15 21:36:09,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:36:09,684 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 894 transitions. [2023-12-15 21:36:09,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 21:36:09,686 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:09,686 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:09,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 21:36:09,686 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:09,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:09,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1762087272, now seen corresponding path program 1 times [2023-12-15 21:36:09,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:09,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068202792] [2023-12-15 21:36:09,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:09,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:36:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:36:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:36:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:36:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:36:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:36:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:36:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:36:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:36:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:36:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:36:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:36:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:36:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:36:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:36:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:36:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:36:09,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:09,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068202792] [2023-12-15 21:36:09,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068202792] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:09,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:09,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:36:09,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669058883] [2023-12-15 21:36:09,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:09,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:36:09,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:09,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:36:09,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:36:09,889 INFO L87 Difference]: Start difference. First operand 640 states and 894 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:36:10,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:10,048 INFO L93 Difference]: Finished difference Result 1147 states and 1600 transitions. [2023-12-15 21:36:10,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:36:10,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2023-12-15 21:36:10,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:10,050 INFO L225 Difference]: With dead ends: 1147 [2023-12-15 21:36:10,050 INFO L226 Difference]: Without dead ends: 644 [2023-12-15 21:36:10,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:36:10,051 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 13 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:10,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 423 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:36:10,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2023-12-15 21:36:10,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 640. [2023-12-15 21:36:10,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 563 states have (on average 1.3428063943161634) internal successors, (756), 568 states have internal predecessors, (756), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 63 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-15 21:36:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 892 transitions. [2023-12-15 21:36:10,094 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 892 transitions. Word has length 155 [2023-12-15 21:36:10,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:10,095 INFO L495 AbstractCegarLoop]: Abstraction has 640 states and 892 transitions. [2023-12-15 21:36:10,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:36:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 892 transitions. [2023-12-15 21:36:10,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 21:36:10,096 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:10,096 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:10,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 21:36:10,096 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:10,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:10,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1700047658, now seen corresponding path program 1 times [2023-12-15 21:36:10,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:10,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612106665] [2023-12-15 21:36:10,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:10,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:10,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:10,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:10,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:36:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:10,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:36:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:10,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:36:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:10,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:36:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:10,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:36:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:10,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:36:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:10,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:36:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:10,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:36:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:10,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:36:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:10,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:36:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:10,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:10,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:36:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:10,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:36:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:10,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:10,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:36:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:10,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:36:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:10,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:36:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:10,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:36:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:36:10,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:10,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612106665] [2023-12-15 21:36:10,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612106665] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:10,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:10,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 21:36:10,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536200972] [2023-12-15 21:36:10,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:10,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:36:10,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:10,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:36:10,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:36:10,767 INFO L87 Difference]: Start difference. First operand 640 states and 892 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-15 21:36:11,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:11,415 INFO L93 Difference]: Finished difference Result 1679 states and 2299 transitions. [2023-12-15 21:36:11,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:36:11,416 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2023-12-15 21:36:11,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:11,419 INFO L225 Difference]: With dead ends: 1679 [2023-12-15 21:36:11,419 INFO L226 Difference]: Without dead ends: 1194 [2023-12-15 21:36:11,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-12-15 21:36:11,422 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 355 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:11,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 519 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:36:11,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2023-12-15 21:36:11,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 652. [2023-12-15 21:36:11,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 575 states have (on average 1.337391304347826) internal successors, (769), 580 states have internal predecessors, (769), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 63 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-15 21:36:11,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 905 transitions. [2023-12-15 21:36:11,471 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 905 transitions. Word has length 155 [2023-12-15 21:36:11,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:11,472 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 905 transitions. [2023-12-15 21:36:11,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-15 21:36:11,472 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 905 transitions. [2023-12-15 21:36:11,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 21:36:11,473 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:11,473 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:11,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 21:36:11,473 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:11,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:11,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1315055960, now seen corresponding path program 1 times [2023-12-15 21:36:11,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:11,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984530270] [2023-12-15 21:36:11,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:11,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:12,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:12,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:12,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:36:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:12,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:36:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:12,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:36:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:12,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:36:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:12,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:36:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:12,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:36:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:12,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:36:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:12,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:36:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:12,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:36:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:12,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:36:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:12,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:12,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:36:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:12,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:36:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:12,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:12,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:36:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:12,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:36:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:12,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:36:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:12,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:36:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:12,472 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:36:12,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:12,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984530270] [2023-12-15 21:36:12,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984530270] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:12,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:12,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-15 21:36:12,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466572525] [2023-12-15 21:36:12,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:12,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-15 21:36:12,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:12,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-15 21:36:12,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:36:12,476 INFO L87 Difference]: Start difference. First operand 652 states and 905 transitions. Second operand has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-15 21:36:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:13,549 INFO L93 Difference]: Finished difference Result 1437 states and 1973 transitions. [2023-12-15 21:36:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 21:36:13,550 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 155 [2023-12-15 21:36:13,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:13,552 INFO L225 Difference]: With dead ends: 1437 [2023-12-15 21:36:13,553 INFO L226 Difference]: Without dead ends: 940 [2023-12-15 21:36:13,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2023-12-15 21:36:13,554 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 278 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:13,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 890 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-15 21:36:13,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2023-12-15 21:36:13,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 766. [2023-12-15 21:36:13,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 670 states have (on average 1.3208955223880596) internal successors, (885), 677 states have internal predecessors, (885), 82 states have call successors, (82), 13 states have call predecessors, (82), 13 states have return successors, (82), 75 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-15 21:36:13,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1049 transitions. [2023-12-15 21:36:13,627 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1049 transitions. Word has length 155 [2023-12-15 21:36:13,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:13,627 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 1049 transitions. [2023-12-15 21:36:13,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 14 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-15 21:36:13,627 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1049 transitions. [2023-12-15 21:36:13,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 21:36:13,628 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:13,629 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:13,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 21:36:13,629 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:13,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:13,629 INFO L85 PathProgramCache]: Analyzing trace with hash -292795912, now seen corresponding path program 1 times [2023-12-15 21:36:13,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:13,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94835866] [2023-12-15 21:36:13,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:13,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:14,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:14,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:14,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:36:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:14,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:36:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:14,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:36:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:14,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:36:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:14,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:36:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:14,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:36:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:14,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:36:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:14,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:36:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:14,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:36:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:14,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:36:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:14,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:14,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:36:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:14,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:36:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:14,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:14,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:36:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:14,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:36:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:14,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:36:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:14,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:36:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:36:14,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:14,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94835866] [2023-12-15 21:36:14,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94835866] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:14,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:14,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-15 21:36:14,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308124997] [2023-12-15 21:36:14,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:14,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-15 21:36:14,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:14,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-15 21:36:14,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:36:14,698 INFO L87 Difference]: Start difference. First operand 766 states and 1049 transitions. Second operand has 13 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-15 21:36:15,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:15,917 INFO L93 Difference]: Finished difference Result 1745 states and 2369 transitions. [2023-12-15 21:36:15,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 21:36:15,918 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 155 [2023-12-15 21:36:15,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:15,920 INFO L225 Difference]: With dead ends: 1745 [2023-12-15 21:36:15,921 INFO L226 Difference]: Without dead ends: 1138 [2023-12-15 21:36:15,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2023-12-15 21:36:15,922 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 349 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:15,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1028 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-15 21:36:15,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2023-12-15 21:36:15,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 850. [2023-12-15 21:36:15,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 746 states have (on average 1.3136729222520107) internal successors, (980), 755 states have internal predecessors, (980), 88 states have call successors, (88), 15 states have call predecessors, (88), 15 states have return successors, (88), 79 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-15 21:36:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1156 transitions. [2023-12-15 21:36:15,999 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1156 transitions. Word has length 155 [2023-12-15 21:36:15,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:15,999 INFO L495 AbstractCegarLoop]: Abstraction has 850 states and 1156 transitions. [2023-12-15 21:36:15,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-15 21:36:15,999 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1156 transitions. [2023-12-15 21:36:16,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-15 21:36:16,000 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:16,000 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:16,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 21:36:16,000 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:16,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:16,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1880155217, now seen corresponding path program 1 times [2023-12-15 21:36:16,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:16,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141437048] [2023-12-15 21:36:16,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:16,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:16,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:16,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:16,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:36:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:16,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:36:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:16,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:36:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:16,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:36:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:16,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:36:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:16,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:36:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:16,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:36:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:16,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:36:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:16,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:36:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:16,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:36:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:16,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:16,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:36:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:16,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:36:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:16,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:16,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:36:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:16,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:36:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:16,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:36:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:16,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:36:16,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:16,958 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:36:16,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:16,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141437048] [2023-12-15 21:36:16,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141437048] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:16,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:16,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-15 21:36:16,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858467868] [2023-12-15 21:36:16,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:16,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-15 21:36:16,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:16,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-15 21:36:16,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2023-12-15 21:36:16,959 INFO L87 Difference]: Start difference. First operand 850 states and 1156 transitions. Second operand has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-15 21:36:18,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:18,501 INFO L93 Difference]: Finished difference Result 1765 states and 2393 transitions. [2023-12-15 21:36:18,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-15 21:36:18,501 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 157 [2023-12-15 21:36:18,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:18,504 INFO L225 Difference]: With dead ends: 1765 [2023-12-15 21:36:18,504 INFO L226 Difference]: Without dead ends: 1074 [2023-12-15 21:36:18,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=867, Unknown=0, NotChecked=0, Total=1056 [2023-12-15 21:36:18,505 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 328 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:18,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1294 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-15 21:36:18,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2023-12-15 21:36:18,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 896. [2023-12-15 21:36:18,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 792 states have (on average 1.3181818181818181) internal successors, (1044), 801 states have internal predecessors, (1044), 88 states have call successors, (88), 15 states have call predecessors, (88), 15 states have return successors, (88), 79 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-15 21:36:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1220 transitions. [2023-12-15 21:36:18,581 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1220 transitions. Word has length 157 [2023-12-15 21:36:18,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:18,581 INFO L495 AbstractCegarLoop]: Abstraction has 896 states and 1220 transitions. [2023-12-15 21:36:18,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-15 21:36:18,581 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1220 transitions. [2023-12-15 21:36:18,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-15 21:36:18,582 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:18,582 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:18,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-15 21:36:18,582 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:18,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:18,582 INFO L85 PathProgramCache]: Analyzing trace with hash 869037967, now seen corresponding path program 1 times [2023-12-15 21:36:18,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:18,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093247678] [2023-12-15 21:36:18,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:18,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:19,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:19,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:19,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:36:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:19,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:36:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:19,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:36:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:19,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:36:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:19,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:36:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:19,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:36:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:19,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:36:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:19,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:36:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:19,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:36:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:19,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:36:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:19,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:19,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:36:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:19,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:36:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:19,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:19,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:36:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:19,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:36:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:19,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:36:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:19,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:36:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:36:19,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:19,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093247678] [2023-12-15 21:36:19,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093247678] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:19,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:19,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:36:19,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530148008] [2023-12-15 21:36:19,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:19,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:36:19,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:19,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:36:19,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:36:19,083 INFO L87 Difference]: Start difference. First operand 896 states and 1220 transitions. Second operand has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-15 21:36:19,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:19,653 INFO L93 Difference]: Finished difference Result 2161 states and 2915 transitions. [2023-12-15 21:36:19,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:36:19,654 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2023-12-15 21:36:19,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:19,658 INFO L225 Difference]: With dead ends: 2161 [2023-12-15 21:36:19,658 INFO L226 Difference]: Without dead ends: 1442 [2023-12-15 21:36:19,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:36:19,659 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 328 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:19,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 477 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:36:19,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2023-12-15 21:36:19,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 894. [2023-12-15 21:36:19,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 790 states have (on average 1.3113924050632912) internal successors, (1036), 799 states have internal predecessors, (1036), 88 states have call successors, (88), 15 states have call predecessors, (88), 15 states have return successors, (88), 79 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-15 21:36:19,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1212 transitions. [2023-12-15 21:36:19,738 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1212 transitions. Word has length 157 [2023-12-15 21:36:19,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:19,738 INFO L495 AbstractCegarLoop]: Abstraction has 894 states and 1212 transitions. [2023-12-15 21:36:19,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-15 21:36:19,738 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1212 transitions. [2023-12-15 21:36:19,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-15 21:36:19,739 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:19,739 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:19,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-15 21:36:19,739 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:19,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:19,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1370682127, now seen corresponding path program 1 times [2023-12-15 21:36:19,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:19,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456391252] [2023-12-15 21:36:19,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:19,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:36:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:36:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:36:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:36:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:36:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:36:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:36:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:36:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:36:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:36:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:36:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:36:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:36:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:36:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:36:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:36:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,216 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:36:20,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:20,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456391252] [2023-12-15 21:36:20,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456391252] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:20,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:20,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:36:20,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294447069] [2023-12-15 21:36:20,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:20,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:36:20,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:20,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:36:20,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:36:20,217 INFO L87 Difference]: Start difference. First operand 894 states and 1212 transitions. Second operand has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-15 21:36:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:20,642 INFO L93 Difference]: Finished difference Result 1587 states and 2147 transitions. [2023-12-15 21:36:20,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:36:20,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2023-12-15 21:36:20,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:20,644 INFO L225 Difference]: With dead ends: 1587 [2023-12-15 21:36:20,644 INFO L226 Difference]: Without dead ends: 852 [2023-12-15 21:36:20,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:36:20,645 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 127 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:20,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 479 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:36:20,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2023-12-15 21:36:20,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852. [2023-12-15 21:36:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 748 states have (on average 1.304812834224599) internal successors, (976), 757 states have internal predecessors, (976), 88 states have call successors, (88), 15 states have call predecessors, (88), 15 states have return successors, (88), 79 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-15 21:36:20,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1152 transitions. [2023-12-15 21:36:20,765 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1152 transitions. Word has length 157 [2023-12-15 21:36:20,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:20,765 INFO L495 AbstractCegarLoop]: Abstraction has 852 states and 1152 transitions. [2023-12-15 21:36:20,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-15 21:36:20,765 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1152 transitions. [2023-12-15 21:36:20,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-15 21:36:20,766 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:20,766 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:20,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-15 21:36:20,766 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:20,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:20,767 INFO L85 PathProgramCache]: Analyzing trace with hash 115595984, now seen corresponding path program 1 times [2023-12-15 21:36:20,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:20,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330586250] [2023-12-15 21:36:20,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:20,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:36:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:36:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:36:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:36:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:36:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:36:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:36:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:36:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:36:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:36:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:36:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:36:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:36:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:36:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:36:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:36:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:36:20,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:20,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330586250] [2023-12-15 21:36:20,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330586250] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:20,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:20,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:36:20,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908064149] [2023-12-15 21:36:20,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:20,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:36:20,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:20,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:36:20,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:36:20,892 INFO L87 Difference]: Start difference. First operand 852 states and 1152 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:36:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:20,984 INFO L93 Difference]: Finished difference Result 1625 states and 2196 transitions. [2023-12-15 21:36:20,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:36:20,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2023-12-15 21:36:20,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:20,987 INFO L225 Difference]: With dead ends: 1625 [2023-12-15 21:36:20,987 INFO L226 Difference]: Without dead ends: 932 [2023-12-15 21:36:20,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:36:20,989 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 27 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:20,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 504 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:36:20,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2023-12-15 21:36:21,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 882. [2023-12-15 21:36:21,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 778 states have (on average 1.2930591259640103) internal successors, (1006), 787 states have internal predecessors, (1006), 88 states have call successors, (88), 15 states have call predecessors, (88), 15 states have return successors, (88), 79 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-15 21:36:21,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1182 transitions. [2023-12-15 21:36:21,065 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1182 transitions. Word has length 157 [2023-12-15 21:36:21,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:21,065 INFO L495 AbstractCegarLoop]: Abstraction has 882 states and 1182 transitions. [2023-12-15 21:36:21,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:36:21,065 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1182 transitions. [2023-12-15 21:36:21,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-15 21:36:21,066 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:21,066 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:21,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-15 21:36:21,067 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:21,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:21,067 INFO L85 PathProgramCache]: Analyzing trace with hash -527183151, now seen corresponding path program 1 times [2023-12-15 21:36:21,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:21,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347733140] [2023-12-15 21:36:21,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:21,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:22,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:22,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:22,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:36:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:22,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:36:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:22,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:36:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:22,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:36:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:22,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:36:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:22,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:36:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:22,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:36:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:22,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:36:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:22,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:36:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:22,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:36:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:22,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:22,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:36:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:22,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:36:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:22,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:22,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:36:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:22,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:36:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:22,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:36:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:22,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:36:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:22,122 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:36:22,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:22,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347733140] [2023-12-15 21:36:22,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347733140] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:22,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:22,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-15 21:36:22,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833154465] [2023-12-15 21:36:22,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:22,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-15 21:36:22,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:22,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-15 21:36:22,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2023-12-15 21:36:22,123 INFO L87 Difference]: Start difference. First operand 882 states and 1182 transitions. Second operand has 18 states, 16 states have (on average 3.75) internal successors, (60), 18 states have internal predecessors, (60), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) Received shutdown request... [2023-12-15 21:36:23,478 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:36:23,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-15 21:36:23,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2023-12-15 21:36:23,480 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 371 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:23,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1146 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1294 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-15 21:36:23,481 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:36:23,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-15 21:36:23,482 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (882states) and FLOYD_HOARE automaton (currently 16 states, 18 states before enhancement),while ReachableStatesComputation was computing reachable states (685 states constructed, input type IntersectNwa). [2023-12-15 21:36:23,485 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:23,501 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:36:23,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:36:23 BoogieIcfgContainer [2023-12-15 21:36:23,503 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:36:23,503 INFO L158 Benchmark]: Toolchain (without parser) took 59989.77ms. Allocated memory was 196.1MB in the beginning and 893.4MB in the end (delta: 697.3MB). Free memory was 133.7MB in the beginning and 728.4MB in the end (delta: -594.8MB). Peak memory consumption was 103.4MB. Max. memory is 8.0GB. [2023-12-15 21:36:23,503 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 196.1MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:36:23,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.59ms. Allocated memory is still 196.1MB. Free memory was 133.5MB in the beginning and 118.2MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-15 21:36:23,504 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.86ms. Allocated memory is still 196.1MB. Free memory was 118.2MB in the beginning and 113.7MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 21:36:23,504 INFO L158 Benchmark]: Boogie Preprocessor took 94.68ms. Allocated memory was 196.1MB in the beginning and 240.1MB in the end (delta: 44.0MB). Free memory was 113.7MB in the beginning and 203.2MB in the end (delta: -89.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-15 21:36:23,504 INFO L158 Benchmark]: RCFGBuilder took 572.65ms. Allocated memory is still 240.1MB. Free memory was 202.7MB in the beginning and 165.5MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2023-12-15 21:36:23,504 INFO L158 Benchmark]: TraceAbstraction took 59048.87ms. Allocated memory was 240.1MB in the beginning and 893.4MB in the end (delta: 653.3MB). Free memory was 165.0MB in the beginning and 728.4MB in the end (delta: -563.5MB). Peak memory consumption was 89.8MB. Max. memory is 8.0GB. [2023-12-15 21:36:23,505 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 196.1MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 220.59ms. Allocated memory is still 196.1MB. Free memory was 133.5MB in the beginning and 118.2MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.86ms. Allocated memory is still 196.1MB. Free memory was 118.2MB in the beginning and 113.7MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 94.68ms. Allocated memory was 196.1MB in the beginning and 240.1MB in the end (delta: 44.0MB). Free memory was 113.7MB in the beginning and 203.2MB in the end (delta: -89.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 572.65ms. Allocated memory is still 240.1MB. Free memory was 202.7MB in the beginning and 165.5MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 59048.87ms. Allocated memory was 240.1MB in the beginning and 893.4MB in the end (delta: 653.3MB). Free memory was 165.0MB in the beginning and 728.4MB in the end (delta: -563.5MB). Peak memory consumption was 89.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was constructing difference of abstraction (882states) and FLOYD_HOARE automaton (currently 16 states, 18 states before enhancement),while ReachableStatesComputation was computing reachable states (685 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 59.0s, OverallIterations: 22, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5708 SdHoareTripleChecker+Valid, 10.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5691 mSDsluCounter, 14869 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11924 mSDsCounter, 502 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12252 IncrementalHoareTripleChecker+Invalid, 12754 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 502 mSolverCounterUnsat, 2945 mSDtfsCounter, 12252 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1336 GetRequests, 1019 SyntacticMatches, 3 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=896occurred in iteration=18, InterpolantAutomatonStates: 213, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 3775 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 39.3s InterpolantComputationTime, 3378 NumberOfCodeBlocks, 3378 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3356 ConstructedInterpolants, 0 QuantifiedInterpolants, 26277 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 16720/16720 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown