/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-a_file-67.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 01:48:10,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 01:48:10,613 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-21 01:48:10,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 01:48:10,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 01:48:10,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 01:48:10,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 01:48:10,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 01:48:10,630 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 01:48:10,630 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 01:48:10,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 01:48:10,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 01:48:10,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 01:48:10,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 01:48:10,631 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 01:48:10,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 01:48:10,632 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 01:48:10,632 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 01:48:10,632 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 01:48:10,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 01:48:10,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 01:48:10,635 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 01:48:10,635 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 01:48:10,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 01:48:10,636 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 01:48:10,636 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 01:48:10,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 01:48:10,636 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 01:48:10,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 01:48:10,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 01:48:10,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 01:48:10,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 01:48:10,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:48:10,640 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 01:48:10,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 01:48:10,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 01:48:10,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 01:48:10,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 01:48:10,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 01:48:10,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 01:48:10,641 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 01:48:10,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 01:48:10,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 01:48:10,641 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-21 01:48:10,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 01:48:10,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 01:48:10,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 01:48:10,831 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 01:48:10,833 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 01:48:10,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i [2023-12-21 01:48:11,897 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 01:48:12,068 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 01:48:12,069 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i [2023-12-21 01:48:12,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e787930/53b3734367804cc9bcbfb1a633923148/FLAG1b38ef821 [2023-12-21 01:48:12,088 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e787930/53b3734367804cc9bcbfb1a633923148 [2023-12-21 01:48:12,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 01:48:12,091 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 01:48:12,092 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 01:48:12,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 01:48:12,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 01:48:12,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:48:12" (1/1) ... [2023-12-21 01:48:12,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6077132d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:12, skipping insertion in model container [2023-12-21 01:48:12,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:48:12" (1/1) ... [2023-12-21 01:48:12,124 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 01:48:12,229 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-a_file-67.i[916,929] [2023-12-21 01:48:12,266 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:48:12,279 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 01:48:12,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-a_file-67.i[916,929] [2023-12-21 01:48:12,307 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:48:12,323 INFO L206 MainTranslator]: Completed translation [2023-12-21 01:48:12,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:12 WrapperNode [2023-12-21 01:48:12,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 01:48:12,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 01:48:12,324 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 01:48:12,324 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 01:48:12,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:12" (1/1) ... [2023-12-21 01:48:12,337 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:12" (1/1) ... [2023-12-21 01:48:12,363 INFO L138 Inliner]: procedures = 29, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 401 [2023-12-21 01:48:12,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 01:48:12,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 01:48:12,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 01:48:12,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 01:48:12,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:12" (1/1) ... [2023-12-21 01:48:12,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:12" (1/1) ... [2023-12-21 01:48:12,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:12" (1/1) ... [2023-12-21 01:48:12,399 INFO L175 MemorySlicer]: Split 106 memory accesses to 7 slices as follows [2, 6, 3, 13, 17, 30, 35]. 33 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 2, 2, 3, 3]. The 16 writes are split as follows [0, 1, 1, 2, 5, 3, 4]. [2023-12-21 01:48:12,399 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:12" (1/1) ... [2023-12-21 01:48:12,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:12" (1/1) ... [2023-12-21 01:48:12,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:12" (1/1) ... [2023-12-21 01:48:12,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:12" (1/1) ... [2023-12-21 01:48:12,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:12" (1/1) ... [2023-12-21 01:48:12,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:12" (1/1) ... [2023-12-21 01:48:12,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 01:48:12,458 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 01:48:12,458 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 01:48:12,458 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 01:48:12,459 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:12" (1/1) ... [2023-12-21 01:48:12,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:48:12,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:48:12,482 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-21 01:48:12,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 01:48:12,516 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-21 01:48:12,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 01:48:12,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 01:48:12,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-21 01:48:12,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-21 01:48:12,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-21 01:48:12,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-21 01:48:12,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-21 01:48:12,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 01:48:12,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 01:48:12,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 01:48:12,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-21 01:48:12,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-21 01:48:12,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-21 01:48:12,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-21 01:48:12,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 01:48:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 01:48:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-21 01:48:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-21 01:48:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-21 01:48:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-21 01:48:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-21 01:48:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 01:48:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 01:48:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 01:48:12,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-21 01:48:12,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-21 01:48:12,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-21 01:48:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-21 01:48:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 01:48:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 01:48:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-21 01:48:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-21 01:48:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-21 01:48:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-21 01:48:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-21 01:48:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 01:48:12,523 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 01:48:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 01:48:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 01:48:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 01:48:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-21 01:48:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-21 01:48:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-21 01:48:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-21 01:48:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 01:48:12,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 01:48:12,650 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 01:48:12,653 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 01:48:12,974 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 01:48:13,010 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 01:48:13,011 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 01:48:13,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:48:13 BoogieIcfgContainer [2023-12-21 01:48:13,011 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 01:48:13,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 01:48:13,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 01:48:13,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 01:48:13,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 01:48:12" (1/3) ... [2023-12-21 01:48:13,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ff9286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:48:13, skipping insertion in model container [2023-12-21 01:48:13,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:12" (2/3) ... [2023-12-21 01:48:13,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ff9286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:48:13, skipping insertion in model container [2023-12-21 01:48:13,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:48:13" (3/3) ... [2023-12-21 01:48:13,018 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-67.i [2023-12-21 01:48:13,030 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 01:48:13,030 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 01:48:13,070 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 01:48:13,075 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;@4de9ada7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 01:48:13,075 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 01:48:13,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 67 states have internal predecessors, (95), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:48:13,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-21 01:48:13,086 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:13,086 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:48:13,087 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:13,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:13,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1500353849, now seen corresponding path program 1 times [2023-12-21 01:48:13,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:13,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508058185] [2023-12-21 01:48:13,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:13,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:13,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:48:13,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508058185] [2023-12-21 01:48:13,298 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-21 01:48:13,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610342389] [2023-12-21 01:48:13,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:13,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:48:13,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:48:13,310 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-21 01:48:13,334 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-21 01:48:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:13,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 01:48:13,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:48:13,544 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2023-12-21 01:48:13,544 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 01:48:13,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610342389] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:48:13,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:48:13,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 01:48:13,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284740952] [2023-12-21 01:48:13,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:48:13,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 01:48:13,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:48:13,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 01:48:13,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 01:48:13,569 INFO L87 Difference]: Start difference. First operand has 81 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 67 states have internal predecessors, (95), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:48:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:48:13,604 INFO L93 Difference]: Finished difference Result 159 states and 248 transitions. [2023-12-21 01:48:13,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 01:48:13,615 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2023-12-21 01:48:13,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:48:13,620 INFO L225 Difference]: With dead ends: 159 [2023-12-21 01:48:13,620 INFO L226 Difference]: Without dead ends: 79 [2023-12-21 01:48:13,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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-21 01:48:13,626 INFO L413 NwaCegarLoop]: 110 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, 110 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-21 01:48:13,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:48:13,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-21 01:48:13,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-12-21 01:48:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:48:13,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2023-12-21 01:48:13,663 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 114 transitions. Word has length 98 [2023-12-21 01:48:13,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:48:13,664 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 114 transitions. [2023-12-21 01:48:13,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:48:13,664 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 114 transitions. [2023-12-21 01:48:13,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-21 01:48:13,668 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:13,669 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:48:13,675 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-21 01:48:13,874 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,SelfDestructingSolverStorable0 [2023-12-21 01:48:13,875 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:13,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:13,875 INFO L85 PathProgramCache]: Analyzing trace with hash -63143223, now seen corresponding path program 1 times [2023-12-21 01:48:13,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:13,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530688764] [2023-12-21 01:48:13,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:13,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:13,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:48:13,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530688764] [2023-12-21 01:48:13,960 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-21 01:48:13,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338930376] [2023-12-21 01:48:13,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:13,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:48:13,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:48:13,975 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:48:13,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 01:48:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:14,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 01:48:14,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:48:14,173 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-12-21 01:48:14,174 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 01:48:14,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338930376] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:48:14,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:48:14,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:48:14,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062255485] [2023-12-21 01:48:14,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:48:14,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:48:14,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:48:14,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:48:14,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:48:14,176 INFO L87 Difference]: Start difference. First operand 79 states and 114 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:48:14,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:48:14,229 INFO L93 Difference]: Finished difference Result 163 states and 236 transitions. [2023-12-21 01:48:14,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:48:14,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2023-12-21 01:48:14,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:48:14,231 INFO L225 Difference]: With dead ends: 163 [2023-12-21 01:48:14,231 INFO L226 Difference]: Without dead ends: 85 [2023-12-21 01:48:14,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 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-21 01:48:14,232 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 10 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 322 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-21 01:48:14,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 322 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:48:14,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-21 01:48:14,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2023-12-21 01:48:14,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:48:14,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 116 transitions. [2023-12-21 01:48:14,239 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 116 transitions. Word has length 98 [2023-12-21 01:48:14,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:48:14,240 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 116 transitions. [2023-12-21 01:48:14,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:48:14,240 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2023-12-21 01:48:14,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-21 01:48:14,241 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:14,241 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:48:14,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 01:48:14,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-21 01:48:14,448 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:14,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:14,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1815987723, now seen corresponding path program 1 times [2023-12-21 01:48:14,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:14,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536282043] [2023-12-21 01:48:14,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:14,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:14,497 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 01:48:14,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [956321537] [2023-12-21 01:48:14,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:14,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:48:14,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:48:14,499 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:48:14,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-21 01:48:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:14,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 01:48:14,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:48:14,681 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:48:14,681 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 01:48:14,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:48:14,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536282043] [2023-12-21 01:48:14,681 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 01:48:14,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956321537] [2023-12-21 01:48:14,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956321537] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:48:14,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:48:14,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:48:14,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725401102] [2023-12-21 01:48:14,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:48:14,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:48:14,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:48:14,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:48:14,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:48:14,683 INFO L87 Difference]: Start difference. First operand 81 states and 116 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:48:14,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:48:14,716 INFO L93 Difference]: Finished difference Result 173 states and 248 transitions. [2023-12-21 01:48:14,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:48:14,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2023-12-21 01:48:14,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:48:14,721 INFO L225 Difference]: With dead ends: 173 [2023-12-21 01:48:14,721 INFO L226 Difference]: Without dead ends: 93 [2023-12-21 01:48:14,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 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-21 01:48:14,722 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 21 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 321 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-21 01:48:14,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 321 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:48:14,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-21 01:48:14,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2023-12-21 01:48:14,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 69 states have internal predecessors, (94), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:48:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 118 transitions. [2023-12-21 01:48:14,734 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 118 transitions. Word has length 98 [2023-12-21 01:48:14,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:48:14,734 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 118 transitions. [2023-12-21 01:48:14,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:48:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 118 transitions. [2023-12-21 01:48:14,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-21 01:48:14,735 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:14,735 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:48:14,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-21 01:48:14,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:48:14,936 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:14,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:14,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1006641097, now seen corresponding path program 1 times [2023-12-21 01:48:14,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:14,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740604662] [2023-12-21 01:48:14,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:14,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:14,967 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 01:48:14,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1682098945] [2023-12-21 01:48:14,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:14,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:48:14,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:48:14,970 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:48:14,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-21 01:48:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:15,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 01:48:15,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:48:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:48:15,172 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 01:48:15,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:48:15,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740604662] [2023-12-21 01:48:15,172 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 01:48:15,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682098945] [2023-12-21 01:48:15,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682098945] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:48:15,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:48:15,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:48:15,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235271849] [2023-12-21 01:48:15,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:48:15,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:48:15,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:48:15,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:48:15,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:48:15,176 INFO L87 Difference]: Start difference. First operand 83 states and 118 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:48:15,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:48:15,210 INFO L93 Difference]: Finished difference Result 173 states and 246 transitions. [2023-12-21 01:48:15,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:48:15,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2023-12-21 01:48:15,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:48:15,215 INFO L225 Difference]: With dead ends: 173 [2023-12-21 01:48:15,215 INFO L226 Difference]: Without dead ends: 91 [2023-12-21 01:48:15,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 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-21 01:48:15,217 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 12 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 319 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-21 01:48:15,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 319 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:48:15,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-21 01:48:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2023-12-21 01:48:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 71 states have (on average 1.352112676056338) internal successors, (96), 71 states have internal predecessors, (96), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:48:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 120 transitions. [2023-12-21 01:48:15,222 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 120 transitions. Word has length 98 [2023-12-21 01:48:15,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:48:15,222 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 120 transitions. [2023-12-21 01:48:15,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:48:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2023-12-21 01:48:15,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-21 01:48:15,223 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:15,224 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:48:15,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-21 01:48:15,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:48:15,432 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:15,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:15,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1063899399, now seen corresponding path program 1 times [2023-12-21 01:48:15,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:15,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51633599] [2023-12-21 01:48:15,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:15,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:15,454 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 01:48:15,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1414552175] [2023-12-21 01:48:15,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:15,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:48:15,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:48:15,456 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:48:15,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-21 01:48:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:15,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 01:48:15,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:48:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:48:15,612 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 01:48:15,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:48:15,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51633599] [2023-12-21 01:48:15,612 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 01:48:15,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414552175] [2023-12-21 01:48:15,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414552175] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:48:15,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:48:15,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:48:15,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754632268] [2023-12-21 01:48:15,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:48:15,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:48:15,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:48:15,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:48:15,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:48:15,613 INFO L87 Difference]: Start difference. First operand 85 states and 120 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:48:15,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:48:15,633 INFO L93 Difference]: Finished difference Result 173 states and 244 transitions. [2023-12-21 01:48:15,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:48:15,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2023-12-21 01:48:15,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:48:15,634 INFO L225 Difference]: With dead ends: 173 [2023-12-21 01:48:15,634 INFO L226 Difference]: Without dead ends: 89 [2023-12-21 01:48:15,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 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-21 01:48:15,635 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 3 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 319 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-21 01:48:15,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 319 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:48:15,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-21 01:48:15,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2023-12-21 01:48:15,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 73 states have internal predecessors, (98), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:48:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 122 transitions. [2023-12-21 01:48:15,640 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 122 transitions. Word has length 98 [2023-12-21 01:48:15,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:48:15,640 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 122 transitions. [2023-12-21 01:48:15,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:48:15,640 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 122 transitions. [2023-12-21 01:48:15,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-21 01:48:15,643 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:15,643 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:48:15,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-21 01:48:15,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:48:15,850 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:15,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:15,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1063958981, now seen corresponding path program 1 times [2023-12-21 01:48:15,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:15,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205243192] [2023-12-21 01:48:15,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:15,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:15,872 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 01:48:15,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [120223094] [2023-12-21 01:48:15,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:15,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:48:15,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:48:15,874 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:48:15,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-21 01:48:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:16,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 53 conjunts are in the unsatisfiable core [2023-12-21 01:48:16,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:48:16,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-21 01:48:16,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2023-12-21 01:48:16,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 01:48:16,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 72 [2023-12-21 01:48:16,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 01:48:16,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 239 treesize of output 119 [2023-12-21 01:48:16,941 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 161 proven. 45 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-12-21 01:48:16,941 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 01:48:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:48:17,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:48:17,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205243192] [2023-12-21 01:48:17,154 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 01:48:17,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120223094] [2023-12-21 01:48:17,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120223094] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 01:48:17,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 01:48:17,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [21] total 24 [2023-12-21 01:48:17,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044121175] [2023-12-21 01:48:17,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:48:17,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:48:17,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:48:17,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:48:17,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2023-12-21 01:48:17,157 INFO L87 Difference]: Start difference. First operand 87 states and 122 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:48:17,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:48:17,271 INFO L93 Difference]: Finished difference Result 277 states and 387 transitions. [2023-12-21 01:48:17,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 01:48:17,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2023-12-21 01:48:17,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:48:17,273 INFO L225 Difference]: With dead ends: 277 [2023-12-21 01:48:17,273 INFO L226 Difference]: Without dead ends: 191 [2023-12-21 01:48:17,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2023-12-21 01:48:17,275 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 166 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:48:17,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 560 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:48:17,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-12-21 01:48:17,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 159. [2023-12-21 01:48:17,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 138 states have (on average 1.3478260869565217) internal successors, (186), 139 states have internal predecessors, (186), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:48:17,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 222 transitions. [2023-12-21 01:48:17,298 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 222 transitions. Word has length 98 [2023-12-21 01:48:17,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:48:17,300 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 222 transitions. [2023-12-21 01:48:17,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:48:17,303 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 222 transitions. [2023-12-21 01:48:17,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-21 01:48:17,304 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:17,304 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:48:17,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-21 01:48:17,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:48:17,517 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:17,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:17,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1486660807, now seen corresponding path program 1 times [2023-12-21 01:48:17,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:17,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806665428] [2023-12-21 01:48:17,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:17,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:17,545 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 01:48:17,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1308696399] [2023-12-21 01:48:17,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:17,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:48:17,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:48:17,546 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:48:17,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-21 01:48:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:17,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 01:48:17,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:48:17,704 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:48:17,705 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 01:48:17,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:48:17,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806665428] [2023-12-21 01:48:17,705 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 01:48:17,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308696399] [2023-12-21 01:48:17,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308696399] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:48:17,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:48:17,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 01:48:17,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232349212] [2023-12-21 01:48:17,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:48:17,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 01:48:17,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:48:17,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 01:48:17,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 01:48:17,706 INFO L87 Difference]: Start difference. First operand 159 states and 222 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:48:17,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:48:17,723 INFO L93 Difference]: Finished difference Result 352 states and 488 transitions. [2023-12-21 01:48:17,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 01:48:17,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2023-12-21 01:48:17,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:48:17,725 INFO L225 Difference]: With dead ends: 352 [2023-12-21 01:48:17,726 INFO L226 Difference]: Without dead ends: 194 [2023-12-21 01:48:17,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 01:48:17,726 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 54 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:48:17,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 273 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:48:17,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-12-21 01:48:17,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 157. [2023-12-21 01:48:17,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 136 states have (on average 1.338235294117647) internal successors, (182), 137 states have internal predecessors, (182), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:48:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 218 transitions. [2023-12-21 01:48:17,734 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 218 transitions. Word has length 98 [2023-12-21 01:48:17,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:48:17,734 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 218 transitions. [2023-12-21 01:48:17,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:48:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 218 transitions. [2023-12-21 01:48:17,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-21 01:48:17,735 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:17,735 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:48:17,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-21 01:48:17,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:48:17,941 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:17,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:17,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2038388077, now seen corresponding path program 1 times [2023-12-21 01:48:17,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:17,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847204311] [2023-12-21 01:48:17,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:17,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:17,975 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 01:48:17,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1076978837] [2023-12-21 01:48:17,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:17,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:48:17,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:48:17,977 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:48:17,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-21 01:48:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:18,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-21 01:48:18,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:48:18,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2023-12-21 01:48:18,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 01:48:18,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2023-12-21 01:48:18,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 01:48:18,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 28 [2023-12-21 01:48:18,284 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-21 01:48:18,284 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 01:48:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:48:18,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:48:18,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847204311] [2023-12-21 01:48:18,331 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 01:48:18,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076978837] [2023-12-21 01:48:18,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076978837] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 01:48:18,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 01:48:18,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2023-12-21 01:48:18,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32325717] [2023-12-21 01:48:18,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:48:18,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:48:18,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:48:18,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:48:18,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-12-21 01:48:18,333 INFO L87 Difference]: Start difference. First operand 157 states and 218 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:48:18,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:48:18,477 INFO L93 Difference]: Finished difference Result 504 states and 698 transitions. [2023-12-21 01:48:18,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 01:48:18,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2023-12-21 01:48:18,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:48:18,479 INFO L225 Difference]: With dead ends: 504 [2023-12-21 01:48:18,479 INFO L226 Difference]: Without dead ends: 348 [2023-12-21 01:48:18,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-12-21 01:48:18,480 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 217 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:48:18,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 597 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:48:18,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-12-21 01:48:18,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 303. [2023-12-21 01:48:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 264 states have (on average 1.3295454545454546) internal successors, (351), 267 states have internal predecessors, (351), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-21 01:48:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 419 transitions. [2023-12-21 01:48:18,491 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 419 transitions. Word has length 100 [2023-12-21 01:48:18,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:48:18,491 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 419 transitions. [2023-12-21 01:48:18,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:48:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 419 transitions. [2023-12-21 01:48:18,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-21 01:48:18,492 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:18,492 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:48:18,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-21 01:48:18,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-21 01:48:18,699 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:18,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:18,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1762599822, now seen corresponding path program 1 times [2023-12-21 01:48:18,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:18,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322508195] [2023-12-21 01:48:18,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:18,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:18,717 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 01:48:18,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [192196929] [2023-12-21 01:48:18,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:18,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:48:18,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:48:18,718 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:48:18,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-21 01:48:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:48:18,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 01:48:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:48:19,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 01:48:19,174 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 01:48:19,175 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 01:48:19,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-21 01:48:19,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:48:19,391 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:48:19,393 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 01:48:19,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 01:48:19 BoogieIcfgContainer [2023-12-21 01:48:19,452 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 01:48:19,452 INFO L158 Benchmark]: Toolchain (without parser) took 7360.91ms. Allocated memory was 314.6MB in the beginning and 418.4MB in the end (delta: 103.8MB). Free memory was 262.0MB in the beginning and 278.4MB in the end (delta: -16.4MB). Peak memory consumption was 88.3MB. Max. memory is 8.0GB. [2023-12-21 01:48:19,452 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 01:48:19,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.80ms. Allocated memory is still 314.6MB. Free memory was 261.4MB in the beginning and 247.3MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-21 01:48:19,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.33ms. Allocated memory is still 314.6MB. Free memory was 247.3MB in the beginning and 243.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 01:48:19,453 INFO L158 Benchmark]: Boogie Preprocessor took 93.34ms. Allocated memory is still 314.6MB. Free memory was 243.6MB in the beginning and 238.9MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 01:48:19,453 INFO L158 Benchmark]: RCFGBuilder took 552.93ms. Allocated memory is still 314.6MB. Free memory was 238.9MB in the beginning and 207.5MB in the end (delta: 31.4MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2023-12-21 01:48:19,453 INFO L158 Benchmark]: TraceAbstraction took 6438.88ms. Allocated memory was 314.6MB in the beginning and 418.4MB in the end (delta: 103.8MB). Free memory was 206.9MB in the beginning and 278.4MB in the end (delta: -71.5MB). Peak memory consumption was 32.7MB. Max. memory is 8.0GB. [2023-12-21 01:48:19,454 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.39ms. Allocated memory is still 201.3MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.80ms. Allocated memory is still 314.6MB. Free memory was 261.4MB in the beginning and 247.3MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.33ms. Allocated memory is still 314.6MB. Free memory was 247.3MB in the beginning and 243.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 93.34ms. Allocated memory is still 314.6MB. Free memory was 243.6MB in the beginning and 238.9MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 552.93ms. Allocated memory is still 314.6MB. Free memory was 238.9MB in the beginning and 207.5MB in the end (delta: 31.4MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6438.88ms. Allocated memory was 314.6MB in the beginning and 418.4MB in the end (delta: 103.8MB). Free memory was 206.9MB in the beginning and 278.4MB in the end (delta: -71.5MB). Peak memory consumption was 32.7MB. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of bitwise operation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] double double_Array_0[1] = { 25.875 }; [L25-L27] double double_Array_0[1] = { 25.875 }; [L28-L30] float float_Array_0[2] = { 0.9, 15.125 }; [L28-L30] float float_Array_0[2] = { 0.9, 15.125 }; [L28-L30] float float_Array_0[2] = { 0.9, 15.125 }; [L31-L33] signed long int signed_long_int_Array_0[2] = { -4, 50 }; [L31-L33] signed long int signed_long_int_Array_0[2] = { -4, 50 }; [L31-L33] signed long int signed_long_int_Array_0[2] = { -4, 50 }; [L34-L36] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L34-L36] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L34-L36] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L34-L36] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L40] signed long int last_1_signed_long_int_Array_0_1_ = 50; [L41] signed short int last_1_signed_short_int_Array_0_2_ = 2; [L42] unsigned short int last_1_unsigned_short_int_Array_0_2_ = 128; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L95] EXPR signed_long_int_Array_0[1] [L95] last_1_signed_long_int_Array_0_1_ = signed_long_int_Array_0[1] [L96] EXPR signed_short_int_Array_0[2] [L96] last_1_signed_short_int_Array_0_2_ = signed_short_int_Array_0[2] [L97] EXPR unsigned_short_int_Array_0[2] [L97] last_1_unsigned_short_int_Array_0_2_ = unsigned_short_int_Array_0[2] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] float_Array_0[0] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[0] [L79] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L79] EXPR float_Array_0[0] [L79] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L81] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] RET assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L85] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L88] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] RET assume_abort_if_not(signed_short_int_Array_0[1] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L91] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L108] RET updateVariables() [L109] CALL step() [L46] COND TRUE ! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_) [L47] EXPR signed_short_int_Array_0[1] [L47] EXPR signed_short_int_Array_0[0] [L47] signed_short_int_Array_0[2] = (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]) [L49] EXPR signed_short_int_Array_0[1] [L49] signed long int stepLocal_0 = 1 * signed_short_int_Array_0[1]; [L50] EXPR signed_short_int_Array_0[2] [L50] EXPR signed_short_int_Array_0[0] [L50] EXPR signed_short_int_Array_0[2] >> signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, stepLocal_0=-42, unsigned_short_int_Array_0={9:0}] [L50] COND FALSE !((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > stepLocal_0) [L53] EXPR unsigned_short_int_Array_0[0] [L53] unsigned_short_int_Array_0[2] = unsigned_short_int_Array_0[0] [L55] EXPR float_Array_0[0] [L55] float_Array_0[1] = float_Array_0[0] [L56] EXPR float_Array_0[0] [L56] double_Array_0[0] = float_Array_0[0] [L57] EXPR unsigned_short_int_Array_0[0] [L57] unsigned_short_int_Array_0[1] = unsigned_short_int_Array_0[0] [L58] EXPR signed_short_int_Array_0[1] [L58] EXPR signed_long_int_Array_0[0] [L58] signed long int stepLocal_2 = signed_short_int_Array_0[1] / signed_long_int_Array_0[0]; [L59] EXPR unsigned_short_int_Array_0[0] [L59] unsigned short int stepLocal_1 = unsigned_short_int_Array_0[0]; [L60] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L60] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L63] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L63] COND FALSE !(unsigned_short_int_Array_0[1] > stepLocal_2) [L70] EXPR unsigned_short_int_Array_0[2] [L70] EXPR signed_short_int_Array_0[0] [L70] signed_long_int_Array_0[1] = (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0]) [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1 [L100] EXPR signed_short_int_Array_0[2] [L100] EXPR signed_short_int_Array_0[1] [L100] EXPR signed_short_int_Array_0[0] [L100] EXPR (! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) [L100] EXPR signed_short_int_Array_0[2] [L100] EXPR signed_short_int_Array_0[0] [L100] EXPR signed_short_int_Array_0[2] >> signed_short_int_Array_0[0] [L100] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])) [L100] EXPR unsigned_short_int_Array_0[2] [L100] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR (((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0) [L100] EXPR unsigned_short_int_Array_0[0] [L100] EXPR (((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR (((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR (((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR (((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR (((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100-L101] return ((((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 9, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 484 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 483 mSDsluCounter, 2821 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1818 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 327 IncrementalHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 1003 mSDtfsCounter, 327 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 985 GetRequests, 934 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303occurred in iteration=8, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 136 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1084 NumberOfCodeBlocks, 1084 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 974 ConstructedInterpolants, 0 QuantifiedInterpolants, 3975 SizeOfPredicates, 35 NumberOfNonLiveVariables, 3265 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 2562/2640 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: unable to determine feasibility of some traces [2023-12-21 01:48:19,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...