/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-10.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 01:39:35,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 01:39:35,785 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:39:35,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 01:39:35,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 01:39:35,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 01:39:35,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 01:39:35,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 01:39:35,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 01:39:35,816 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 01:39:35,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 01:39:35,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 01:39:35,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 01:39:35,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 01:39:35,818 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 01:39:35,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 01:39:35,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 01:39:35,819 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 01:39:35,819 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 01:39:35,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 01:39:35,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 01:39:35,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 01:39:35,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 01:39:35,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 01:39:35,821 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 01:39:35,821 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 01:39:35,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 01:39:35,821 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 01:39:35,821 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 01:39:35,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 01:39:35,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 01:39:35,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 01:39:35,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:39:35,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 01:39:35,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 01:39:35,823 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 01:39:35,823 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 01:39:35,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 01:39:35,823 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 01:39:35,823 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 01:39:35,824 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 01:39:35,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 01:39:35,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 01:39:35,825 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:39:35,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 01:39:35,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 01:39:35,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 01:39:35,980 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 01:39:35,981 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 01:39:35,981 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-10.i [2023-12-21 01:39:37,024 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 01:39:37,215 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 01:39:37,215 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i [2023-12-21 01:39:37,225 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c6639e41/864c91b516774048a4cd4ab9176d0239/FLAGe83d84a8d [2023-12-21 01:39:37,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c6639e41/864c91b516774048a4cd4ab9176d0239 [2023-12-21 01:39:37,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 01:39:37,237 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 01:39:37,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 01:39:37,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 01:39:37,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 01:39:37,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:39:37" (1/1) ... [2023-12-21 01:39:37,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ef4cc22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:37, skipping insertion in model container [2023-12-21 01:39:37,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:39:37" (1/1) ... [2023-12-21 01:39:37,262 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 01:39:37,351 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-10.i[916,929] [2023-12-21 01:39:37,392 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:39:37,401 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 01:39:37,408 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-10.i[916,929] [2023-12-21 01:39:37,453 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:39:37,467 INFO L206 MainTranslator]: Completed translation [2023-12-21 01:39:37,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:37 WrapperNode [2023-12-21 01:39:37,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 01:39:37,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 01:39:37,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 01:39:37,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 01:39:37,473 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:39:37" (1/1) ... [2023-12-21 01:39:37,503 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:39:37" (1/1) ... [2023-12-21 01:39:37,562 INFO L138 Inliner]: procedures = 29, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 501 [2023-12-21 01:39:37,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 01:39:37,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 01:39:37,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 01:39:37,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 01:39:37,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:37" (1/1) ... [2023-12-21 01:39:37,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:37" (1/1) ... [2023-12-21 01:39:37,587 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:37" (1/1) ... [2023-12-21 01:39:37,606 INFO L175 MemorySlicer]: Split 142 memory accesses to 8 slices as follows [2, 11, 36, 3, 48, 13, 11, 18]. 34 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 2, 4, 1, 5, 2, 2, 2]. The 22 writes are split as follows [0, 2, 6, 1, 6, 3, 2, 2]. [2023-12-21 01:39:37,606 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:37" (1/1) ... [2023-12-21 01:39:37,606 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:37" (1/1) ... [2023-12-21 01:39:37,629 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:37" (1/1) ... [2023-12-21 01:39:37,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:37" (1/1) ... [2023-12-21 01:39:37,635 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:37" (1/1) ... [2023-12-21 01:39:37,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:37" (1/1) ... [2023-12-21 01:39:37,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 01:39:37,657 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 01:39:37,657 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 01:39:37,657 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 01:39:37,658 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:37" (1/1) ... [2023-12-21 01:39:37,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:39:37,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:39:37,678 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:39:37,688 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:39:37,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 01:39:37,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 01:39:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 01:39:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-21 01:39:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-21 01:39:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-21 01:39:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-21 01:39:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-21 01:39:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2023-12-21 01:39:37,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 01:39:37,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 01:39:37,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 01:39:37,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-21 01:39:37,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-21 01:39:37,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-21 01:39:37,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-21 01:39:37,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-21 01:39:37,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 01:39:37,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 01:39:37,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-21 01:39:37,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-21 01:39:37,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-21 01:39:37,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-21 01:39:37,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-21 01:39:37,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2023-12-21 01:39:37,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 01:39:37,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 01:39:37,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 01:39:37,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-21 01:39:37,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-21 01:39:37,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-21 01:39:37,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-21 01:39:37,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-21 01:39:37,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 01:39:37,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 01:39:37,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-21 01:39:37,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-21 01:39:37,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-21 01:39:37,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-21 01:39:37,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-21 01:39:37,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2023-12-21 01:39:37,729 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 01:39:37,729 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 01:39:37,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 01:39:37,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 01:39:37,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 01:39:37,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-21 01:39:37,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-21 01:39:37,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-21 01:39:37,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-21 01:39:37,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-21 01:39:37,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 01:39:37,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 01:39:37,889 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 01:39:37,890 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 01:39:38,289 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 01:39:38,320 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 01:39:38,320 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 01:39:38,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:39:38 BoogieIcfgContainer [2023-12-21 01:39:38,321 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 01:39:38,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 01:39:38,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 01:39:38,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 01:39:38,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 01:39:37" (1/3) ... [2023-12-21 01:39:38,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4601475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:39:38, skipping insertion in model container [2023-12-21 01:39:38,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:37" (2/3) ... [2023-12-21 01:39:38,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4601475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:39:38, skipping insertion in model container [2023-12-21 01:39:38,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:39:38" (3/3) ... [2023-12-21 01:39:38,327 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-10.i [2023-12-21 01:39:38,339 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 01:39:38,340 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 01:39:38,380 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 01:39:38,386 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;@40282fe2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 01:39:38,386 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 01:39:38,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 83 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-21 01:39:38,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-21 01:39:38,407 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:38,407 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:38,408 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:38,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:38,412 INFO L85 PathProgramCache]: Analyzing trace with hash 842837506, now seen corresponding path program 1 times [2023-12-21 01:39:38,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:38,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808019084] [2023-12-21 01:39:38,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:38,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:38,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:39:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:38,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:39:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:38,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:39:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:38,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:39:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:38,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:39:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:38,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:39:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:38,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:39:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:38,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:39:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:38,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:39:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:38,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:39:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:38,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:39:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:38,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:39:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:38,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:39:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:38,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:39:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:38,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:39:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:38,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:39:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:38,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:39:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:38,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:39:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:38,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:39:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:38,795 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-21 01:39:38,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:39:38,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808019084] [2023-12-21 01:39:38,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808019084] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:39:38,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:39:38,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 01:39:38,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721234336] [2023-12-21 01:39:38,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:39:38,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 01:39:38,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:39:38,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 01:39:38,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 01:39:38,823 INFO L87 Difference]: Start difference. First operand has 104 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 83 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-21 01:39:38,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:39:38,863 INFO L93 Difference]: Finished difference Result 205 states and 325 transitions. [2023-12-21 01:39:38,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 01:39:38,866 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2023-12-21 01:39:38,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:39:38,874 INFO L225 Difference]: With dead ends: 205 [2023-12-21 01:39:38,874 INFO L226 Difference]: Without dead ends: 102 [2023-12-21 01:39:38,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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:39:38,881 INFO L413 NwaCegarLoop]: 143 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, 143 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:39:38,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:39:38,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-21 01:39:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-12-21 01:39:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.345679012345679) internal successors, (109), 81 states have internal predecessors, (109), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-21 01:39:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 147 transitions. [2023-12-21 01:39:38,924 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 147 transitions. Word has length 147 [2023-12-21 01:39:38,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:39:38,924 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 147 transitions. [2023-12-21 01:39:38,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-21 01:39:38,925 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 147 transitions. [2023-12-21 01:39:38,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-21 01:39:38,927 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:38,927 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:38,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 01:39:38,927 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:38,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:38,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1622074856, now seen corresponding path program 1 times [2023-12-21 01:39:38,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:38,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030301407] [2023-12-21 01:39:38,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:38,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:39:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:39:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:39:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:39:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:39:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:39:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:39:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:39:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:39:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:39:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:39:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:39:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:39:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:39:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:39:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:39:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:39:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:39:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:39:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,297 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-21 01:39:39,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:39:39,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030301407] [2023-12-21 01:39:39,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030301407] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:39:39,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:39:39,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:39:39,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406540172] [2023-12-21 01:39:39,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:39:39,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:39:39,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:39:39,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:39:39,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:39:39,304 INFO L87 Difference]: Start difference. First operand 102 states and 147 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-21 01:39:39,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:39:39,371 INFO L93 Difference]: Finished difference Result 209 states and 302 transitions. [2023-12-21 01:39:39,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:39:39,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2023-12-21 01:39:39,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:39:39,373 INFO L225 Difference]: With dead ends: 209 [2023-12-21 01:39:39,373 INFO L226 Difference]: Without dead ends: 108 [2023-12-21 01:39:39,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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:39:39,374 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 10 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:39:39,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 418 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:39:39,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-21 01:39:39,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2023-12-21 01:39:39,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-21 01:39:39,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 149 transitions. [2023-12-21 01:39:39,383 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 149 transitions. Word has length 147 [2023-12-21 01:39:39,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:39:39,383 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 149 transitions. [2023-12-21 01:39:39,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-21 01:39:39,383 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 149 transitions. [2023-12-21 01:39:39,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-21 01:39:39,385 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:39,385 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:39,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 01:39:39,385 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:39,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:39,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1258608358, now seen corresponding path program 1 times [2023-12-21 01:39:39,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:39,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249462158] [2023-12-21 01:39:39,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:39,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:39:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:39:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:39:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:39:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:39:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:39:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:39:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:39:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:39:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:39:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:39:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:39:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:39:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:39:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:39:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:39:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:39:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:39:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:39:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,606 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-21 01:39:39,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:39:39,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249462158] [2023-12-21 01:39:39,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249462158] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:39:39,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:39:39,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:39:39,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053117614] [2023-12-21 01:39:39,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:39:39,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:39:39,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:39:39,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:39:39,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:39:39,611 INFO L87 Difference]: Start difference. First operand 104 states and 149 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-21 01:39:39,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:39:39,653 INFO L93 Difference]: Finished difference Result 219 states and 314 transitions. [2023-12-21 01:39:39,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:39:39,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-12-21 01:39:39,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:39:39,657 INFO L225 Difference]: With dead ends: 219 [2023-12-21 01:39:39,657 INFO L226 Difference]: Without dead ends: 116 [2023-12-21 01:39:39,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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:39:39,662 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 21 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 420 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:39:39,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 420 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:39:39,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-21 01:39:39,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2023-12-21 01:39:39,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 85 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-21 01:39:39,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2023-12-21 01:39:39,669 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 147 [2023-12-21 01:39:39,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:39:39,669 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2023-12-21 01:39:39,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-21 01:39:39,669 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2023-12-21 01:39:39,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-21 01:39:39,671 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:39,671 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:39,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 01:39:39,671 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:39,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:39,672 INFO L85 PathProgramCache]: Analyzing trace with hash 449261732, now seen corresponding path program 1 times [2023-12-21 01:39:39,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:39,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454496733] [2023-12-21 01:39:39,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:39,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:39:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:39:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:39:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:39:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:39:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:39:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:39:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:39:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:39:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:39:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:39:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:39:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:39:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:39:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:39:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:39:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:39:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:39:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:39:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:39,863 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-21 01:39:39,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:39:39,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454496733] [2023-12-21 01:39:39,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454496733] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:39:39,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:39:39,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:39:39,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503355600] [2023-12-21 01:39:39,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:39:39,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:39:39,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:39:39,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:39:39,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:39:39,866 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-21 01:39:39,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:39:39,904 INFO L93 Difference]: Finished difference Result 219 states and 312 transitions. [2023-12-21 01:39:39,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:39:39,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-12-21 01:39:39,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:39:39,907 INFO L225 Difference]: With dead ends: 219 [2023-12-21 01:39:39,907 INFO L226 Difference]: Without dead ends: 114 [2023-12-21 01:39:39,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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:39:39,912 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 12 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 418 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:39:39,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 418 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:39:39,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-21 01:39:39,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2023-12-21 01:39:39,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 87 states have internal predecessors, (115), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-21 01:39:39,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2023-12-21 01:39:39,919 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 147 [2023-12-21 01:39:39,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:39:39,919 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2023-12-21 01:39:39,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-21 01:39:39,919 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2023-12-21 01:39:39,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-21 01:39:39,921 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:39,921 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:39,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 01:39:39,921 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:39,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:39,922 INFO L85 PathProgramCache]: Analyzing trace with hash 506520034, now seen corresponding path program 1 times [2023-12-21 01:39:39,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:39,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149564236] [2023-12-21 01:39:39,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:39,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:39:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:39:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:39:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:39:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:39:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:39:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:39:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:39:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:39:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:39:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:39:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:39:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:39:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:39:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:39:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:39:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:39:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:39:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:39:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-21 01:39:40,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:39:40,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149564236] [2023-12-21 01:39:40,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149564236] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:39:40,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:39:40,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:39:40,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854469609] [2023-12-21 01:39:40,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:39:40,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:39:40,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:39:40,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:39:40,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:39:40,069 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-21 01:39:40,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:39:40,093 INFO L93 Difference]: Finished difference Result 219 states and 310 transitions. [2023-12-21 01:39:40,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:39:40,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-12-21 01:39:40,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:39:40,094 INFO L225 Difference]: With dead ends: 219 [2023-12-21 01:39:40,094 INFO L226 Difference]: Without dead ends: 112 [2023-12-21 01:39:40,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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:39:40,095 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 3 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 418 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:39:40,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 418 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:39:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-21 01:39:40,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2023-12-21 01:39:40,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 89 states have internal predecessors, (117), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-21 01:39:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 155 transitions. [2023-12-21 01:39:40,101 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 155 transitions. Word has length 147 [2023-12-21 01:39:40,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:39:40,101 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 155 transitions. [2023-12-21 01:39:40,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-21 01:39:40,101 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 155 transitions. [2023-12-21 01:39:40,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-21 01:39:40,103 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:40,103 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:40,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 01:39:40,103 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:40,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:40,103 INFO L85 PathProgramCache]: Analyzing trace with hash 506579616, now seen corresponding path program 1 times [2023-12-21 01:39:40,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:40,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168910193] [2023-12-21 01:39:40,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:40,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:39:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:39:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:39:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:39:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:39:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:39:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:39:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:39:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:39:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:39:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:39:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:39:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:39:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:39:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:39:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:39:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:39:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:39:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:39:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-21 01:39:40,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:39:40,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168910193] [2023-12-21 01:39:40,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168910193] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:39:40,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:39:40,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:39:40,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384918710] [2023-12-21 01:39:40,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:39:40,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:39:40,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:39:40,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:39:40,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:39:40,921 INFO L87 Difference]: Start difference. First operand 110 states and 155 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-21 01:39:41,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:39:41,114 INFO L93 Difference]: Finished difference Result 267 states and 378 transitions. [2023-12-21 01:39:41,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:39:41,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2023-12-21 01:39:41,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:39:41,116 INFO L225 Difference]: With dead ends: 267 [2023-12-21 01:39:41,116 INFO L226 Difference]: Without dead ends: 158 [2023-12-21 01:39:41,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:39:41,117 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 125 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 01:39:41,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 819 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 01:39:41,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-12-21 01:39:41,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2023-12-21 01:39:41,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 122 states have (on average 1.2950819672131149) internal successors, (158), 123 states have internal predecessors, (158), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-21 01:39:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 222 transitions. [2023-12-21 01:39:41,153 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 222 transitions. Word has length 147 [2023-12-21 01:39:41,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:39:41,153 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 222 transitions. [2023-12-21 01:39:41,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-21 01:39:41,153 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 222 transitions. [2023-12-21 01:39:41,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-21 01:39:41,154 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:41,154 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:41,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 01:39:41,155 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:41,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:41,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2143186299, now seen corresponding path program 1 times [2023-12-21 01:39:41,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:41,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026511499] [2023-12-21 01:39:41,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:41,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:39:41,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 01:39:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:39:41,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 01:39:41,408 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 01:39:41,409 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 01:39:41,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 01:39:41,413 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:39:41,416 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 01:39:41,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 01:39:41 BoogieIcfgContainer [2023-12-21 01:39:41,584 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 01:39:41,585 INFO L158 Benchmark]: Toolchain (without parser) took 4347.71ms. Allocated memory was 205.5MB in the beginning and 378.5MB in the end (delta: 173.0MB). Free memory was 143.6MB in the beginning and 333.3MB in the end (delta: -189.7MB). Peak memory consumption was 161.0MB. Max. memory is 8.0GB. [2023-12-21 01:39:41,585 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 205.5MB. Free memory is still 155.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 01:39:41,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.65ms. Allocated memory is still 205.5MB. Free memory was 143.4MB in the beginning and 128.1MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-21 01:39:41,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.34ms. Allocated memory was 205.5MB in the beginning and 277.9MB in the end (delta: 72.4MB). Free memory was 128.1MB in the beginning and 243.8MB in the end (delta: -115.7MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2023-12-21 01:39:41,585 INFO L158 Benchmark]: Boogie Preprocessor took 93.46ms. Allocated memory is still 277.9MB. Free memory was 243.8MB in the beginning and 238.5MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-21 01:39:41,585 INFO L158 Benchmark]: RCFGBuilder took 663.78ms. Allocated memory is still 277.9MB. Free memory was 238.5MB in the beginning and 203.4MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2023-12-21 01:39:41,586 INFO L158 Benchmark]: TraceAbstraction took 3261.85ms. Allocated memory was 277.9MB in the beginning and 378.5MB in the end (delta: 100.7MB). Free memory was 202.4MB in the beginning and 333.3MB in the end (delta: -131.0MB). Peak memory consumption was 146.4MB. Max. memory is 8.0GB. [2023-12-21 01:39:41,587 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.44ms. Allocated memory is still 205.5MB. Free memory is still 155.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 228.65ms. Allocated memory is still 205.5MB. Free memory was 143.4MB in the beginning and 128.1MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 94.34ms. Allocated memory was 205.5MB in the beginning and 277.9MB in the end (delta: 72.4MB). Free memory was 128.1MB in the beginning and 243.8MB in the end (delta: -115.7MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 93.46ms. Allocated memory is still 277.9MB. Free memory was 243.8MB in the beginning and 238.5MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 663.78ms. Allocated memory is still 277.9MB. Free memory was 238.5MB in the beginning and 203.4MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3261.85ms. Allocated memory was 277.9MB in the beginning and 378.5MB in the end (delta: 100.7MB). Free memory was 202.4MB in the beginning and 333.3MB in the end (delta: -131.0MB). Peak memory consumption was 146.4MB. 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 someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someUnaryDOUBLEoperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2][2] = { {-0.8, 1000000.875}, {49.25, 9.15} }; [L25-L27] double double_Array_0[2][2] = { {-0.8, 1000000.875}, {49.25, 9.15} }; [L25-L27] double double_Array_0[2][2] = { {-0.8, 1000000.875}, {49.25, 9.15} }; [L25-L27] double double_Array_0[2][2] = { {-0.8, 1000000.875}, {49.25, 9.15} }; [L25-L27] double double_Array_0[2][2] = { {-0.8, 1000000.875}, {49.25, 9.15} }; [L28-L30] float float_Array_0[1] = { -0.5 }; [L28-L30] float float_Array_0[1] = { -0.5 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L34-L36] signed long int signed_long_int_Array_0[2] = { 1000000000, 32 }; [L34-L36] signed long int signed_long_int_Array_0[2] = { 1000000000, 32 }; [L34-L36] signed long int signed_long_int_Array_0[2] = { 1000000000, 32 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 8, 5 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 8, 5 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 8, 5 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[2] = { 58996, 32 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[2] = { 58996, 32 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[2] = { 58996, 32 }; [L43] double last_1_double_Array_0_1__1_ = 9.15; [L113] isInitial = 1 [L114] FCALL initially() [L115] COND TRUE 1 [L116] CALL updateLastVariables() [L106] EXPR double_Array_0[1][1] [L106] last_1_double_Array_0_1__1_ = double_Array_0[1][1] [L116] RET updateLastVariables() [L117] CALL updateVariables() [L74] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10: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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L76] EXPR BOOL_unsigned_char_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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10: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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L77] double_Array_0[0][0] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[0][0] [L78] EXPR double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L78] EXPR double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F [L78] EXPR double_Array_0[0][0] [L78] EXPR double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L78] EXPR (double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L78] EXPR (double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L78] CALL assume_abort_if_not((double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10: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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L78] RET assume_abort_if_not((double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L79] double_Array_0[1][0] = __VERIFIER_nondet_double() [L80] EXPR double_Array_0[1][0] [L80] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F [L80] EXPR double_Array_0[1][0] [L80] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] CALL assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10: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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] RET assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L81] double_Array_0[0][1] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[0][1] [L82] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F [L82] EXPR double_Array_0[0][1] [L82] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] EXPR (double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] EXPR (double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] CALL assume_abort_if_not((double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10: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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] RET assume_abort_if_not((double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L83] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L84] EXPR signed_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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L84] CALL assume_abort_if_not(signed_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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10: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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L84] RET assume_abort_if_not(signed_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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] EXPR signed_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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10: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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L86] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L87] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[2] >= 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10: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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L88] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L88] CALL assume_abort_if_not(signed_char_Array_0[2] <= 126) 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10: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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L88] RET assume_abort_if_not(signed_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] signed_char_Array_0[3] = __VERIFIER_nondet_char() [L90] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[3] >= 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10: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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] CALL assume_abort_if_not(signed_char_Array_0[3] <= 126) 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10: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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] RET assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L92] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L93] 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L93] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= 536870911) 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10: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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L93] RET assume_abort_if_not(signed_long_int_Array_0[0] >= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L94] 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L94] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 1073741823) 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10: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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L94] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L95] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L96] EXPR unsigned_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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L96] CALL assume_abort_if_not(unsigned_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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10: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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L96] RET assume_abort_if_not(unsigned_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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR unsigned_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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10: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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L98] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L99] 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L99] 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10: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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L99] 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L100] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65535) 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10: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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L100] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L101] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L102] 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L102] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10: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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L102] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L103] 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L103] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10: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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L103] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L117] RET updateVariables() [L118] CALL step() [L47] EXPR unsigned_long_int_Array_0[0] [L47] unsigned_long_int_Array_0[1] = unsigned_long_int_Array_0[0] [L48] EXPR double_Array_0[0][0] [L48] float_Array_0[0] = double_Array_0[0][0] [L49] EXPR signed_char_Array_0[0] [L49] signed_char_Array_0[4] = signed_char_Array_0[0] [L50] EXPR BOOL_unsigned_char_Array_0[1] [L50] BOOL_unsigned_char_Array_0[0] = BOOL_unsigned_char_Array_0[1] [L51] EXPR signed_char_Array_0[4] [L51] signed char stepLocal_1 = signed_char_Array_0[4]; [L52] EXPR unsigned_short_int_Array_0[0] [L52] 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L52] COND FALSE !((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= stepLocal_1) [L55] EXPR signed_char_Array_0[0] [L55] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L55] EXPR ((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]) [L55] EXPR signed_char_Array_0[0] [L55] EXPR ((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_1=-1, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L55] signed_char_Array_0[1] = ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))) [L57] 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L57] COND TRUE BOOL_unsigned_char_Array_0[0] [L58] EXPR signed_char_Array_0[0] [L58] EXPR signed_char_Array_0[3] [L58] signed_long_int_Array_0[1] = (signed_char_Array_0[0] - signed_char_Array_0[3]) [L62] EXPR signed_long_int_Array_0[1] [L62] signed long int stepLocal_0 = signed_long_int_Array_0[1]; [L63] EXPR unsigned_long_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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L63] COND TRUE stepLocal_0 < unsigned_long_int_Array_0[1] [L64] double_Array_0[1][1] = -0.5 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L118] RET step() [L119] CALL, EXPR property() [L109] EXPR unsigned_long_int_Array_0[1] [L109] EXPR unsigned_long_int_Array_0[0] [L109] EXPR (unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0])))) [L109] EXPR signed_long_int_Array_0[1] [L109] EXPR unsigned_long_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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))) [L109] EXPR double_Array_0[1][1] [L109] EXPR (signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0]))) && (signed_char_Array_0[4] == ((signed char) signed_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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0]))) && (signed_char_Array_0[4] == ((signed char) signed_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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0]))) && (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0]))) && (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109-L110] return ((((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0]))) && (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) ; [L119] RET, EXPR property() [L119] 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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10: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_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 7, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 2636 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1728 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 205 IncrementalHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 908 mSDtfsCounter, 205 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=6, InterpolantAutomatonStates: 28, 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, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1031 NumberOfCodeBlocks, 1031 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 876 ConstructedInterpolants, 0 QuantifiedInterpolants, 990 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 4104/4104 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:39:41,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...