/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-37.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:21:41,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:21:41,238 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-16 04:21:41,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:21:41,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:21:41,269 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:21:41,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:21:41,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:21:41,270 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:21:41,273 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:21:41,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:21:41,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:21:41,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:21:41,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:21:41,275 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:21:41,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:21:41,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:21:41,276 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:21:41,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:21:41,277 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:21:41,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:21:41,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:21:41,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:21:41,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:21:41,278 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:21:41,278 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:21:41,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:21:41,278 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:21:41,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:21:41,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:21:41,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:21:41,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:21:41,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:21:41,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:21:41,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:21:41,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:21:41,280 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:21:41,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:21:41,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:21:41,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:21:41,281 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:21:41,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:21:41,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:21:41,281 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 -> false [2023-12-16 04:21:41,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:21:41,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:21:41,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:21:41,513 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:21:41,514 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:21:41,515 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-37.i [2023-12-16 04:21:42,658 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:21:42,839 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:21:42,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-37.i [2023-12-16 04:21:42,848 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68e6109ed/64ae2e9eda444794aeb6d8de635bb31b/FLAG307204523 [2023-12-16 04:21:42,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68e6109ed/64ae2e9eda444794aeb6d8de635bb31b [2023-12-16 04:21:42,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:21:42,867 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:21:42,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:21:42,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:21:42,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:21:42,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:21:42" (1/1) ... [2023-12-16 04:21:42,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7451810a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:42, skipping insertion in model container [2023-12-16 04:21:42,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:21:42" (1/1) ... [2023-12-16 04:21:42,943 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:21:43,179 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-37.i[917,930] [2023-12-16 04:21:43,253 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:21:43,275 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:21:43,286 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-37.i[917,930] [2023-12-16 04:21:43,319 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:21:43,347 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:21:43,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:43 WrapperNode [2023-12-16 04:21:43,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:21:43,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:21:43,349 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:21:43,349 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:21:43,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:43" (1/1) ... [2023-12-16 04:21:43,381 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:43" (1/1) ... [2023-12-16 04:21:43,417 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 476 [2023-12-16 04:21:43,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:21:43,418 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:21:43,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:21:43,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:21:43,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:43" (1/1) ... [2023-12-16 04:21:43,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:43" (1/1) ... [2023-12-16 04:21:43,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:43" (1/1) ... [2023-12-16 04:21:43,476 INFO L175 MemorySlicer]: Split 124 memory accesses to 8 slices as follows [2, 8, 52, 20, 7, 15, 6, 14]. 42 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 2, 1, 2, 1, 2]. The 17 writes are split as follows [0, 1, 7, 2, 1, 3, 1, 2]. [2023-12-16 04:21:43,476 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:43" (1/1) ... [2023-12-16 04:21:43,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:43" (1/1) ... [2023-12-16 04:21:43,487 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:43" (1/1) ... [2023-12-16 04:21:43,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:43" (1/1) ... [2023-12-16 04:21:43,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:43" (1/1) ... [2023-12-16 04:21:43,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:43" (1/1) ... [2023-12-16 04:21:43,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:21:43,521 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:21:43,521 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:21:43,521 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:21:43,522 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:43" (1/1) ... [2023-12-16 04:21:43,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:21:43,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:21:43,587 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-16 04:21:43,589 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-16 04:21:43,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:21:43,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-16 04:21:43,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-16 04:21:43,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-16 04:21:43,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-16 04:21:43,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-16 04:21:43,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-16 04:21:43,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-16 04:21:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2023-12-16 04:21:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:21:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:21:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-16 04:21:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-16 04:21:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-16 04:21:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-16 04:21:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-16 04:21:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-16 04:21:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-16 04:21:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-16 04:21:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-16 04:21:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-16 04:21:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-16 04:21:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-16 04:21:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-16 04:21:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2023-12-16 04:21:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:21:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:21:43,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-16 04:21:43,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-16 04:21:43,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-16 04:21:43,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-16 04:21:43,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-16 04:21:43,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-16 04:21:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-16 04:21:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-16 04:21:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-16 04:21:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-16 04:21:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-16 04:21:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-16 04:21:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-16 04:21:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2023-12-16 04:21:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:21:43,649 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:21:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:21:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:21:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-16 04:21:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-16 04:21:43,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-16 04:21:43,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-16 04:21:43,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-16 04:21:43,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-16 04:21:43,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:21:43,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:21:43,809 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:21:43,810 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:21:44,111 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:21:44,138 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:21:44,138 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:21:44,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:21:44 BoogieIcfgContainer [2023-12-16 04:21:44,138 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:21:44,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:21:44,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:21:44,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:21:44,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:21:42" (1/3) ... [2023-12-16 04:21:44,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e0551a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:21:44, skipping insertion in model container [2023-12-16 04:21:44,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:43" (2/3) ... [2023-12-16 04:21:44,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e0551a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:21:44, skipping insertion in model container [2023-12-16 04:21:44,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:21:44" (3/3) ... [2023-12-16 04:21:44,144 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-37.i [2023-12-16 04:21:44,157 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:21:44,158 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:21:44,190 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:21:44,195 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;@1d09f290, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:21:44,196 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:21:44,200 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 73 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:21:44,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 04:21:44,211 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:21:44,212 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:21:44,212 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:21:44,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:21:44,216 INFO L85 PathProgramCache]: Analyzing trace with hash 466555047, now seen corresponding path program 1 times [2023-12-16 04:21:44,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:21:44,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917800019] [2023-12-16 04:21:44,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:21:44,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:21:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:44,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:21:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:44,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 04:21:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:44,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:21:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:44,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 04:21:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:44,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:21:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:44,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:21:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:44,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:21:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:44,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:21:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:44,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:21:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:44,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:21:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:44,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:21:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:44,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:21:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:44,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:21:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:44,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:21:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:44,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:21:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:44,636 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:21:44,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:21:44,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917800019] [2023-12-16 04:21:44,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917800019] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:21:44,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:21:44,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:21:44,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283338142] [2023-12-16 04:21:44,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:21:44,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:21:44,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:21:44,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:21:44,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:21:44,672 INFO L87 Difference]: Start difference. First operand has 90 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 73 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:21:44,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:21:44,738 INFO L93 Difference]: Finished difference Result 177 states and 279 transitions. [2023-12-16 04:21:44,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:21:44,740 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 117 [2023-12-16 04:21:44,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:21:44,746 INFO L225 Difference]: With dead ends: 177 [2023-12-16 04:21:44,746 INFO L226 Difference]: Without dead ends: 88 [2023-12-16 04:21:44,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-16 04:21:44,750 INFO L413 NwaCegarLoop]: 124 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, 124 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-16 04:21:44,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:21:44,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-16 04:21:44,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-12-16 04:21:44,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.380281690140845) internal successors, (98), 71 states have internal predecessors, (98), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:21:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2023-12-16 04:21:44,787 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 117 [2023-12-16 04:21:44,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:21:44,787 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2023-12-16 04:21:44,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:21:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2023-12-16 04:21:44,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 04:21:44,790 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:21:44,790 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:21:44,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:21:44,790 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:21:44,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:21:44,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1678433335, now seen corresponding path program 1 times [2023-12-16 04:21:44,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:21:44,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829340643] [2023-12-16 04:21:44,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:21:44,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:21:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:21:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 04:21:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:21:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 04:21:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:21:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:21:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:21:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:21:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:21:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:21:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:21:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:21:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:21:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:21:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:21:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:21:45,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:21:45,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829340643] [2023-12-16 04:21:45,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829340643] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:21:45,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:21:45,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:21:45,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2573248] [2023-12-16 04:21:45,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:21:45,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:21:45,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:21:45,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:21:45,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:21:45,095 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:21:45,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:21:45,159 INFO L93 Difference]: Finished difference Result 187 states and 272 transitions. [2023-12-16 04:21:45,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:21:45,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2023-12-16 04:21:45,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:21:45,163 INFO L225 Difference]: With dead ends: 187 [2023-12-16 04:21:45,163 INFO L226 Difference]: Without dead ends: 100 [2023-12-16 04:21:45,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-16 04:21:45,166 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 21 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:21:45,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 363 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:21:45,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-16 04:21:45,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2023-12-16 04:21:45,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:21:45,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 130 transitions. [2023-12-16 04:21:45,178 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 130 transitions. Word has length 117 [2023-12-16 04:21:45,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:21:45,179 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 130 transitions. [2023-12-16 04:21:45,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:21:45,179 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 130 transitions. [2023-12-16 04:21:45,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 04:21:45,181 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:21:45,181 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:21:45,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:21:45,181 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:21:45,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:21:45,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1807187335, now seen corresponding path program 1 times [2023-12-16 04:21:45,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:21:45,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399931843] [2023-12-16 04:21:45,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:21:45,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:21:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:21:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 04:21:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:21:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 04:21:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:21:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:21:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:21:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:21:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:21:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:21:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:21:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:21:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:21:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:21:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:21:45,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,417 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:21:45,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:21:45,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399931843] [2023-12-16 04:21:45,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399931843] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:21:45,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:21:45,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:21:45,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567325857] [2023-12-16 04:21:45,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:21:45,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:21:45,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:21:45,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:21:45,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:21:45,449 INFO L87 Difference]: Start difference. First operand 90 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:21:45,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:21:45,488 INFO L93 Difference]: Finished difference Result 187 states and 270 transitions. [2023-12-16 04:21:45,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:21:45,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2023-12-16 04:21:45,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:21:45,491 INFO L225 Difference]: With dead ends: 187 [2023-12-16 04:21:45,491 INFO L226 Difference]: Without dead ends: 98 [2023-12-16 04:21:45,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-16 04:21:45,492 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 12 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 361 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-16 04:21:45,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 361 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:21:45,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-16 04:21:45,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2023-12-16 04:21:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:21:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2023-12-16 04:21:45,497 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 117 [2023-12-16 04:21:45,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:21:45,498 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2023-12-16 04:21:45,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:21:45,498 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2023-12-16 04:21:45,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 04:21:45,499 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:21:45,499 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:21:45,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:21:45,500 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:21:45,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:21:45,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1864445637, now seen corresponding path program 1 times [2023-12-16 04:21:45,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:21:45,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064148787] [2023-12-16 04:21:45,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:21:45,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:21:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:21:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 04:21:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:21:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 04:21:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:21:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:21:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:21:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:21:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:21:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:21:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:21:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:21:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:21:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:21:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:21:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:21:45,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:21:45,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064148787] [2023-12-16 04:21:45,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064148787] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:21:45,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:21:45,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:21:45,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362211495] [2023-12-16 04:21:45,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:21:45,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:21:45,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:21:45,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:21:45,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:21:45,676 INFO L87 Difference]: Start difference. First operand 92 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:21:45,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:21:45,707 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2023-12-16 04:21:45,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:21:45,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2023-12-16 04:21:45,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:21:45,711 INFO L225 Difference]: With dead ends: 187 [2023-12-16 04:21:45,711 INFO L226 Difference]: Without dead ends: 96 [2023-12-16 04:21:45,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-16 04:21:45,714 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 3 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:21:45,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 361 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:21:45,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-16 04:21:45,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2023-12-16 04:21:45,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:21:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2023-12-16 04:21:45,719 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 117 [2023-12-16 04:21:45,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:21:45,720 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2023-12-16 04:21:45,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:21:45,720 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2023-12-16 04:21:45,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 04:21:45,721 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:21:45,721 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:21:45,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:21:45,722 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:21:45,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:21:45,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1864505219, now seen corresponding path program 1 times [2023-12-16 04:21:45,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:21:45,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363438820] [2023-12-16 04:21:45,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:21:45,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:21:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:46,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:21:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:46,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 04:21:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:46,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:21:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:46,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 04:21:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:46,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:21:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:46,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:21:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:46,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:21:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:46,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:21:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:46,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:21:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:46,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:21:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:46,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:21:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:46,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:21:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:46,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:21:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:46,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:21:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:46,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:21:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:46,692 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:21:46,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:21:46,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363438820] [2023-12-16 04:21:46,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363438820] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:21:46,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:21:46,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:21:46,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155024390] [2023-12-16 04:21:46,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:21:46,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:21:46,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:21:46,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:21:46,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:21:46,698 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-12-16 04:21:46,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:21:46,947 INFO L93 Difference]: Finished difference Result 211 states and 300 transitions. [2023-12-16 04:21:46,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:21:46,948 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 117 [2023-12-16 04:21:46,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:21:46,949 INFO L225 Difference]: With dead ends: 211 [2023-12-16 04:21:46,949 INFO L226 Difference]: Without dead ends: 118 [2023-12-16 04:21:46,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:21:46,952 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 311 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:21:46,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 515 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:21:46,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-16 04:21:46,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2023-12-16 04:21:46,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 92 states have (on average 1.315217391304348) internal successors, (121), 93 states have internal predecessors, (121), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 04:21:46,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 165 transitions. [2023-12-16 04:21:46,978 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 165 transitions. Word has length 117 [2023-12-16 04:21:46,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:21:46,980 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 165 transitions. [2023-12-16 04:21:46,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-12-16 04:21:46,980 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 165 transitions. [2023-12-16 04:21:46,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 04:21:46,984 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:21:46,984 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:21:46,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:21:46,984 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:21:46,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:21:46,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1075417738, now seen corresponding path program 1 times [2023-12-16 04:21:46,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:21:46,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345466366] [2023-12-16 04:21:46,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:21:46,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:21:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:47,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:21:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:47,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 04:21:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:47,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:21:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:47,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 04:21:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:47,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:21:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:47,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:21:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:47,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:21:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:47,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:21:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:47,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:21:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:47,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:21:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:47,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:21:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:47,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:21:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:47,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:21:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:47,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:21:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:47,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:21:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:47,391 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:21:47,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:21:47,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345466366] [2023-12-16 04:21:47,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345466366] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:21:47,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:21:47,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:21:47,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90250065] [2023-12-16 04:21:47,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:21:47,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:21:47,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:21:47,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:21:47,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:21:47,393 INFO L87 Difference]: Start difference. First operand 117 states and 165 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:21:47,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:21:47,626 INFO L93 Difference]: Finished difference Result 339 states and 473 transitions. [2023-12-16 04:21:47,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:21:47,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2023-12-16 04:21:47,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:21:47,629 INFO L225 Difference]: With dead ends: 339 [2023-12-16 04:21:47,629 INFO L226 Difference]: Without dead ends: 242 [2023-12-16 04:21:47,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:21:47,632 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 279 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:21:47,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 645 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:21:47,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-12-16 04:21:47,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 210. [2023-12-16 04:21:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 168 states have (on average 1.3154761904761905) internal successors, (221), 170 states have internal predecessors, (221), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2023-12-16 04:21:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 295 transitions. [2023-12-16 04:21:47,647 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 295 transitions. Word has length 120 [2023-12-16 04:21:47,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:21:47,647 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 295 transitions. [2023-12-16 04:21:47,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:21:47,647 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 295 transitions. [2023-12-16 04:21:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 04:21:47,648 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:21:47,648 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:21:47,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:21:47,649 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:21:47,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:21:47,649 INFO L85 PathProgramCache]: Analyzing trace with hash -2086534988, now seen corresponding path program 1 times [2023-12-16 04:21:47,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:21:47,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560007737] [2023-12-16 04:21:47,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:21:47,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:21:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:49,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:21:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:49,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 04:21:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:49,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:21:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:49,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 04:21:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:49,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:21:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:50,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:21:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:50,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:21:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:50,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:21:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:50,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:21:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:50,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:21:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:50,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:21:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:50,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:21:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:50,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:21:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:50,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:21:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:50,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:21:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:21:50,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:21:50,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560007737] [2023-12-16 04:21:50,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560007737] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:21:50,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:21:50,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 04:21:50,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940160955] [2023-12-16 04:21:50,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:21:50,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 04:21:50,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:21:50,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 04:21:50,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:21:50,079 INFO L87 Difference]: Start difference. First operand 210 states and 295 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-12-16 04:21:51,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:21:51,037 INFO L93 Difference]: Finished difference Result 574 states and 800 transitions. [2023-12-16 04:21:51,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 04:21:51,038 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 120 [2023-12-16 04:21:51,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:21:51,040 INFO L225 Difference]: With dead ends: 574 [2023-12-16 04:21:51,040 INFO L226 Difference]: Without dead ends: 384 [2023-12-16 04:21:51,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2023-12-16 04:21:51,043 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 579 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:21:51,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 595 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:21:51,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2023-12-16 04:21:51,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 334. [2023-12-16 04:21:51,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 288 states have (on average 1.3472222222222223) internal successors, (388), 292 states have internal predecessors, (388), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 35 states have call predecessors, (39), 39 states have call successors, (39) [2023-12-16 04:21:51,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 466 transitions. [2023-12-16 04:21:51,104 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 466 transitions. Word has length 120 [2023-12-16 04:21:51,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:21:51,104 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 466 transitions. [2023-12-16 04:21:51,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-12-16 04:21:51,104 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 466 transitions. [2023-12-16 04:21:51,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 04:21:51,105 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:21:51,105 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:21:51,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 04:21:51,106 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:21:51,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:21:51,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1621626294, now seen corresponding path program 1 times [2023-12-16 04:21:51,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:21:51,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551222504] [2023-12-16 04:21:51,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:21:51,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:21:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:51,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:21:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:51,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 04:21:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:51,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:21:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:51,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 04:21:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:51,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:21:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:51,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:21:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:51,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:21:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:51,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:21:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:51,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:21:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:51,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:21:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:51,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:21:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:51,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:21:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:51,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:21:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:51,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:21:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:51,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:21:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:21:51,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:21:51,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551222504] [2023-12-16 04:21:51,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551222504] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:21:51,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:21:51,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 04:21:51,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070257308] [2023-12-16 04:21:51,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:21:51,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 04:21:51,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:21:51,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 04:21:51,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:21:51,596 INFO L87 Difference]: Start difference. First operand 334 states and 466 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:21:52,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:21:52,004 INFO L93 Difference]: Finished difference Result 753 states and 1042 transitions. [2023-12-16 04:21:52,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 04:21:52,004 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2023-12-16 04:21:52,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:21:52,006 INFO L225 Difference]: With dead ends: 753 [2023-12-16 04:21:52,006 INFO L226 Difference]: Without dead ends: 439 [2023-12-16 04:21:52,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:21:52,007 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 396 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:21:52,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 868 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:21:52,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-12-16 04:21:52,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 357. [2023-12-16 04:21:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 299 states have (on average 1.3277591973244147) internal successors, (397), 303 states have internal predecessors, (397), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2023-12-16 04:21:52,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 495 transitions. [2023-12-16 04:21:52,043 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 495 transitions. Word has length 120 [2023-12-16 04:21:52,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:21:52,043 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 495 transitions. [2023-12-16 04:21:52,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:21:52,044 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 495 transitions. [2023-12-16 04:21:52,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 04:21:52,044 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:21:52,045 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:21:52,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 04:21:52,045 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:21:52,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:21:52,045 INFO L85 PathProgramCache]: Analyzing trace with hash 402993974, now seen corresponding path program 1 times [2023-12-16 04:21:52,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:21:52,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097502751] [2023-12-16 04:21:52,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:21:52,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:21:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:52,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:21:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:52,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 04:21:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:52,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:21:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:52,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 04:21:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:52,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:21:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:52,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:21:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:52,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:21:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:52,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:21:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:52,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:21:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:52,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:21:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:52,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:21:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:52,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:21:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:52,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:21:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:52,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:21:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:52,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:21:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:52,549 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:21:52,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:21:52,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097502751] [2023-12-16 04:21:52,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097502751] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:21:52,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:21:52,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:21:52,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980211771] [2023-12-16 04:21:52,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:21:52,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:21:52,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:21:52,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:21:52,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:21:52,551 INFO L87 Difference]: Start difference. First operand 357 states and 495 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:21:52,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:21:52,992 INFO L93 Difference]: Finished difference Result 758 states and 1042 transitions. [2023-12-16 04:21:52,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 04:21:52,993 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2023-12-16 04:21:52,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:21:52,995 INFO L225 Difference]: With dead ends: 758 [2023-12-16 04:21:52,995 INFO L226 Difference]: Without dead ends: 421 [2023-12-16 04:21:52,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:21:52,997 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 328 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:21:52,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 847 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:21:52,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2023-12-16 04:21:53,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 343. [2023-12-16 04:21:53,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 293 states have (on average 1.3310580204778157) internal successors, (390), 297 states have internal predecessors, (390), 41 states have call successors, (41), 8 states have call predecessors, (41), 8 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-16 04:21:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 472 transitions. [2023-12-16 04:21:53,036 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 472 transitions. Word has length 120 [2023-12-16 04:21:53,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:21:53,037 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 472 transitions. [2023-12-16 04:21:53,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:21:53,037 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 472 transitions. [2023-12-16 04:21:53,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 04:21:53,038 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:21:53,038 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:21:53,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 04:21:53,038 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:21:53,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:21:53,038 INFO L85 PathProgramCache]: Analyzing trace with hash -183812040, now seen corresponding path program 1 times [2023-12-16 04:21:53,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:21:53,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874665509] [2023-12-16 04:21:53,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:21:53,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:21:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:53,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:21:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:53,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 04:21:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:53,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:21:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:53,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 04:21:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:53,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:21:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:53,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:21:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:53,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:21:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:53,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:21:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:53,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:21:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:53,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:21:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:53,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:21:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:53,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:21:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:53,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:21:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:53,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:21:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:53,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:21:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:21:53,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:21:53,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874665509] [2023-12-16 04:21:53,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874665509] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:21:53,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:21:53,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:21:53,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001113011] [2023-12-16 04:21:53,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:21:53,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:21:53,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:21:53,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:21:53,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:21:53,477 INFO L87 Difference]: Start difference. First operand 343 states and 472 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:21:53,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:21:53,773 INFO L93 Difference]: Finished difference Result 701 states and 956 transitions. [2023-12-16 04:21:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 04:21:53,774 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2023-12-16 04:21:53,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:21:53,775 INFO L225 Difference]: With dead ends: 701 [2023-12-16 04:21:53,775 INFO L226 Difference]: Without dead ends: 378 [2023-12-16 04:21:53,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:21:53,776 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 357 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:21:53,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 679 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:21:53,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2023-12-16 04:21:53,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 253. [2023-12-16 04:21:53,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 212 states have (on average 1.3254716981132075) internal successors, (281), 214 states have internal predecessors, (281), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-16 04:21:53,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 347 transitions. [2023-12-16 04:21:53,809 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 347 transitions. Word has length 120 [2023-12-16 04:21:53,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:21:53,810 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 347 transitions. [2023-12-16 04:21:53,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:21:53,810 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 347 transitions. [2023-12-16 04:21:53,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 04:21:53,811 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:21:53,811 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:21:53,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 04:21:53,811 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:21:53,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:21:53,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1802772362, now seen corresponding path program 1 times [2023-12-16 04:21:53,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:21:53,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290320933] [2023-12-16 04:21:53,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:21:53,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:21:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:54,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:21:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:54,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 04:21:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:54,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:21:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:54,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 04:21:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:54,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:21:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:54,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:21:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:54,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:21:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:54,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:21:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:54,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:21:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:54,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:21:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:54,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:21:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:54,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:21:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:54,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:21:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:54,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:21:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:54,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:21:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:54,291 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:21:54,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:21:54,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290320933] [2023-12-16 04:21:54,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290320933] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:21:54,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:21:54,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 04:21:54,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452443003] [2023-12-16 04:21:54,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:21:54,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 04:21:54,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:21:54,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 04:21:54,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:21:54,292 INFO L87 Difference]: Start difference. First operand 253 states and 347 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:21:54,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:21:54,886 INFO L93 Difference]: Finished difference Result 605 states and 821 transitions. [2023-12-16 04:21:54,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 04:21:54,887 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2023-12-16 04:21:54,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:21:54,888 INFO L225 Difference]: With dead ends: 605 [2023-12-16 04:21:54,888 INFO L226 Difference]: Without dead ends: 371 [2023-12-16 04:21:54,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:21:54,889 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 374 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 04:21:54,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 928 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 04:21:54,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2023-12-16 04:21:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 251. [2023-12-16 04:21:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 210 states have (on average 1.319047619047619) internal successors, (277), 212 states have internal predecessors, (277), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-16 04:21:54,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 343 transitions. [2023-12-16 04:21:54,921 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 343 transitions. Word has length 120 [2023-12-16 04:21:54,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:21:54,921 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 343 transitions. [2023-12-16 04:21:54,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:21:54,921 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 343 transitions. [2023-12-16 04:21:54,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 04:21:54,922 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:21:54,922 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:21:54,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 04:21:54,923 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:21:54,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:21:54,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1273562614, now seen corresponding path program 1 times [2023-12-16 04:21:54,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:21:54,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557439304] [2023-12-16 04:21:54,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:21:54,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:21:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:55,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:21:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:55,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 04:21:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:55,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:21:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:55,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 04:21:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:55,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:21:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:55,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:21:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:55,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:21:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:55,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:21:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:55,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:21:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:55,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:21:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:55,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:21:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:55,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:21:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:55,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:21:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:55,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:21:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:55,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:21:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:55,330 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:21:55,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:21:55,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557439304] [2023-12-16 04:21:55,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557439304] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:21:55,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:21:55,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:21:55,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727245500] [2023-12-16 04:21:55,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:21:55,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:21:55,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:21:55,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:21:55,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:21:55,331 INFO L87 Difference]: Start difference. First operand 251 states and 343 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:21:55,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:21:55,720 INFO L93 Difference]: Finished difference Result 547 states and 740 transitions. [2023-12-16 04:21:55,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:21:55,720 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2023-12-16 04:21:55,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:21:55,723 INFO L225 Difference]: With dead ends: 547 [2023-12-16 04:21:55,723 INFO L226 Difference]: Without dead ends: 316 [2023-12-16 04:21:55,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:21:55,724 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 257 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:21:55,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 871 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:21:55,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2023-12-16 04:21:55,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 245. [2023-12-16 04:21:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 204 states have (on average 1.3186274509803921) internal successors, (269), 206 states have internal predecessors, (269), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-16 04:21:55,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 335 transitions. [2023-12-16 04:21:55,757 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 335 transitions. Word has length 120 [2023-12-16 04:21:55,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:21:55,759 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 335 transitions. [2023-12-16 04:21:55,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:21:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 335 transitions. [2023-12-16 04:21:55,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-16 04:21:55,760 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:21:55,760 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:21:55,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 04:21:55,760 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:21:55,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:21:55,761 INFO L85 PathProgramCache]: Analyzing trace with hash -35020257, now seen corresponding path program 1 times [2023-12-16 04:21:55,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:21:55,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206495236] [2023-12-16 04:21:55,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:21:55,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:21:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:56,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 04:21:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:56,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 04:21:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:56,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:21:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:56,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 04:21:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:56,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:21:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:56,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:21:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:56,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:21:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:56,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:21:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:56,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:21:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:56,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:21:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:56,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:21:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:56,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:21:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:56,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:21:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:56,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:21:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:56,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:21:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-16 04:21:56,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:21:56,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206495236] [2023-12-16 04:21:56,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206495236] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:21:56,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907298103] [2023-12-16 04:21:56,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:21:56,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:21:56,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:21:56,955 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:21:56,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 04:21:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:21:57,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-16 04:21:57,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:21:57,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2023-12-16 04:21:57,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2023-12-16 04:21:57,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2023-12-16 04:21:58,123 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2023-12-16 04:21:58,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 169 treesize of output 159 [2023-12-16 04:21:58,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:22:00,204 INFO L349 Elim1Store]: treesize reduction 2040, result has 12.7 percent of original size [2023-12-16 04:22:00,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 8 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 17 new quantified variables, introduced 100 case distinctions, treesize of input 435 treesize of output 939 [2023-12-16 04:22:03,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:22:03,775 INFO L349 Elim1Store]: treesize reduction 104, result has 14.8 percent of original size [2023-12-16 04:22:03,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 143 [2023-12-16 04:22:03,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:22:04,104 INFO L349 Elim1Store]: treesize reduction 104, result has 14.8 percent of original size [2023-12-16 04:22:04,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 143 [2023-12-16 04:22:04,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:22:04,463 INFO L349 Elim1Store]: treesize reduction 104, result has 14.8 percent of original size [2023-12-16 04:22:04,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 143 [2023-12-16 04:22:04,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:22:04,790 INFO L349 Elim1Store]: treesize reduction 104, result has 14.8 percent of original size [2023-12-16 04:22:04,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 143 [2023-12-16 04:22:04,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:22:05,105 INFO L349 Elim1Store]: treesize reduction 104, result has 14.8 percent of original size [2023-12-16 04:22:05,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 143 [2023-12-16 04:22:05,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:22:05,426 INFO L349 Elim1Store]: treesize reduction 104, result has 14.8 percent of original size [2023-12-16 04:22:05,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 143 [2023-12-16 04:22:05,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:22:05,816 INFO L349 Elim1Store]: treesize reduction 104, result has 14.8 percent of original size [2023-12-16 04:22:05,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 143 [2023-12-16 04:22:12,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:22:12,803 INFO L349 Elim1Store]: treesize reduction 688, result has 9.1 percent of original size [2023-12-16 04:22:12,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 34 case distinctions, treesize of input 409 treesize of output 561 [2023-12-16 04:22:13,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:22:13,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 88 [2023-12-16 04:22:14,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:22:14,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 88 [2023-12-16 04:22:14,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:22:15,036 INFO L349 Elim1Store]: treesize reduction 128, result has 35.0 percent of original size [2023-12-16 04:22:15,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 250 treesize of output 294 [2023-12-16 04:22:15,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:22:16,177 INFO L349 Elim1Store]: treesize reduction 1080, result has 8.7 percent of original size [2023-12-16 04:22:16,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 57 case distinctions, treesize of input 459 treesize of output 641 [2023-12-16 04:22:19,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:22:19,638 INFO L349 Elim1Store]: treesize reduction 240, result has 30.0 percent of original size [2023-12-16 04:22:19,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 33 case distinctions, treesize of input 284 treesize of output 358 [2023-12-16 04:22:20,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:22:20,753 INFO L349 Elim1Store]: treesize reduction 1080, result has 8.7 percent of original size [2023-12-16 04:22:20,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 57 case distinctions, treesize of input 562 treesize of output 740 [2023-12-16 04:22:27,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:22:27,744 INFO L349 Elim1Store]: treesize reduction 880, result has 8.9 percent of original size [2023-12-16 04:22:27,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 450 treesize of output 617 [2023-12-16 04:22:29,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:22:29,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2023-12-16 04:22:30,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:22:30,200 INFO L349 Elim1Store]: treesize reduction 41, result has 30.5 percent of original size [2023-12-16 04:22:30,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 90 [2023-12-16 04:22:30,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:22:30,348 INFO L349 Elim1Store]: treesize reduction 41, result has 30.5 percent of original size [2023-12-16 04:22:30,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 58 [2023-12-16 04:22:30,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:22:30,697 INFO L349 Elim1Store]: treesize reduction 90, result has 28.0 percent of original size [2023-12-16 04:22:30,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 87 treesize of output 110 [2023-12-16 04:22:32,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:22:33,316 INFO L349 Elim1Store]: treesize reduction 880, result has 8.9 percent of original size [2023-12-16 04:22:33,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 537 treesize of output 700 [2023-12-16 04:22:38,673 INFO L190 IndexEqualityManager]: detected not equals via solver Received shutdown request... [2023-12-16 04:22:45,881 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 04:22:45,881 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-16 04:22:46,050 WARN L235 SmtUtils]: Removed 347 from assertion stack [2023-12-16 04:22:46,052 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:22:46,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-16 04:22:46,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-16 04:22:46,253 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 123 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1537 for 7339ms.. [2023-12-16 04:22:46,256 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:22:46,258 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:22:46,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:22:46 BoogieIcfgContainer [2023-12-16 04:22:46,259 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:22:46,259 INFO L158 Benchmark]: Toolchain (without parser) took 63392.69ms. Allocated memory was 185.6MB in the beginning and 1.1GB in the end (delta: 899.7MB). Free memory was 135.3MB in the beginning and 649.7MB in the end (delta: -514.4MB). Peak memory consumption was 646.3MB. Max. memory is 8.0GB. [2023-12-16 04:22:46,259 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 185.6MB. Free memory is still 137.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:22:46,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.07ms. Allocated memory is still 185.6MB. Free memory was 135.3MB in the beginning and 120.5MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 04:22:46,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.03ms. Allocated memory is still 185.6MB. Free memory was 120.5MB in the beginning and 116.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:22:46,259 INFO L158 Benchmark]: Boogie Preprocessor took 102.03ms. Allocated memory is still 185.6MB. Free memory was 116.9MB in the beginning and 112.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:22:46,259 INFO L158 Benchmark]: RCFGBuilder took 617.45ms. Allocated memory was 185.6MB in the beginning and 276.8MB in the end (delta: 91.2MB). Free memory was 112.1MB in the beginning and 232.1MB in the end (delta: -120.0MB). Peak memory consumption was 28.9MB. Max. memory is 8.0GB. [2023-12-16 04:22:46,259 INFO L158 Benchmark]: TraceAbstraction took 62118.93ms. Allocated memory was 276.8MB in the beginning and 1.1GB in the end (delta: 808.5MB). Free memory was 231.5MB in the beginning and 649.7MB in the end (delta: -418.2MB). Peak memory consumption was 649.9MB. Max. memory is 8.0GB. [2023-12-16 04:22:46,260 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.45ms. Allocated memory is still 185.6MB. Free memory is still 137.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 479.07ms. Allocated memory is still 185.6MB. Free memory was 135.3MB in the beginning and 120.5MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.03ms. Allocated memory is still 185.6MB. Free memory was 120.5MB in the beginning and 116.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 102.03ms. Allocated memory is still 185.6MB. Free memory was 116.9MB in the beginning and 112.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 617.45ms. Allocated memory was 185.6MB in the beginning and 276.8MB in the end (delta: 91.2MB). Free memory was 112.1MB in the beginning and 232.1MB in the end (delta: -120.0MB). Peak memory consumption was 28.9MB. Max. memory is 8.0GB. * TraceAbstraction took 62118.93ms. Allocated memory was 276.8MB in the beginning and 1.1GB in the end (delta: 808.5MB). Free memory was 231.5MB in the beginning and 649.7MB in the end (delta: -418.2MB). Peak memory consumption was 649.9MB. 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 analyzing trace of length 123 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1537 for 7339ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 62.1s, OverallIterations: 13, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2917 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2917 mSDsluCounter, 7157 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5436 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3056 IncrementalHoareTripleChecker+Invalid, 3191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 1721 mSDtfsCounter, 3056 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 504 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=357occurred in iteration=8, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 577 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 1425 NumberOfCodeBlocks, 1425 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1413 ConstructedInterpolants, 0 QuantifiedInterpolants, 9043 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 5040/5040 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