/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-52.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 15:03:23,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 15:03:23,618 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-19 15:03:23,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 15:03:23,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 15:03:23,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 15:03:23,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 15:03:23,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 15:03:23,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 15:03:23,657 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 15:03:23,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 15:03:23,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 15:03:23,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 15:03:23,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 15:03:23,659 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 15:03:23,660 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 15:03:23,660 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 15:03:23,660 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 15:03:23,660 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 15:03:23,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 15:03:23,661 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 15:03:23,661 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 15:03:23,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 15:03:23,662 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 15:03:23,662 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 15:03:23,662 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 15:03:23,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 15:03:23,662 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 15:03:23,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 15:03:23,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 15:03:23,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 15:03:23,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 15:03:23,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:03:23,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 15:03:23,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 15:03:23,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 15:03:23,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 15:03:23,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 15:03:23,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 15:03:23,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 15:03:23,665 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 15:03:23,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 15:03:23,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 15:03:23,666 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 15:03:23,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 15:03:23,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 15:03:23,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 15:03:23,905 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 15:03:23,905 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 15:03:23,906 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-52.i [2023-12-19 15:03:25,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 15:03:25,297 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 15:03:25,297 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-52.i [2023-12-19 15:03:25,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af5cbbbb0/8085fd1cc6f54b0b92451c6bd09cc42f/FLAGaf5357cec [2023-12-19 15:03:25,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af5cbbbb0/8085fd1cc6f54b0b92451c6bd09cc42f [2023-12-19 15:03:25,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 15:03:25,325 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 15:03:25,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 15:03:25,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 15:03:25,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 15:03:25,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:03:25" (1/1) ... [2023-12-19 15:03:25,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aaf148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:25, skipping insertion in model container [2023-12-19 15:03:25,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:03:25" (1/1) ... [2023-12-19 15:03:25,362 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 15:03:25,469 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-52.i[916,929] [2023-12-19 15:03:25,516 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:03:25,526 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 15:03:25,535 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-52.i[916,929] [2023-12-19 15:03:25,573 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:03:25,588 INFO L206 MainTranslator]: Completed translation [2023-12-19 15:03:25,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:25 WrapperNode [2023-12-19 15:03:25,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 15:03:25,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 15:03:25,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 15:03:25,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 15:03:25,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:25" (1/1) ... [2023-12-19 15:03:25,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:25" (1/1) ... [2023-12-19 15:03:25,643 INFO L138 Inliner]: procedures = 29, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 463 [2023-12-19 15:03:25,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 15:03:25,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 15:03:25,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 15:03:25,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 15:03:25,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:25" (1/1) ... [2023-12-19 15:03:25,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:25" (1/1) ... [2023-12-19 15:03:25,666 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:25" (1/1) ... [2023-12-19 15:03:25,701 INFO L175 MemorySlicer]: Split 122 memory accesses to 6 slices as follows [2, 35, 47, 29, 6, 3]. 39 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 3, 1, 1]. The 18 writes are split as follows [0, 7, 5, 4, 1, 1]. [2023-12-19 15:03:25,709 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:25" (1/1) ... [2023-12-19 15:03:25,709 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:25" (1/1) ... [2023-12-19 15:03:25,740 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:25" (1/1) ... [2023-12-19 15:03:25,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:25" (1/1) ... [2023-12-19 15:03:25,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:25" (1/1) ... [2023-12-19 15:03:25,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:25" (1/1) ... [2023-12-19 15:03:25,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 15:03:25,752 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 15:03:25,753 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 15:03:25,753 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 15:03:25,753 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:25" (1/1) ... [2023-12-19 15:03:25,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:03:25,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:03:25,818 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-19 15:03:25,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 15:03:25,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 15:03:25,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 15:03:25,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-19 15:03:25,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-19 15:03:25,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-19 15:03:25,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-19 15:03:25,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 15:03:25,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 15:03:25,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-19 15:03:25,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-19 15:03:25,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-19 15:03:25,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-19 15:03:25,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 15:03:25,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 15:03:25,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-19 15:03:25,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-19 15:03:25,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-19 15:03:25,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-19 15:03:25,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 15:03:25,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 15:03:25,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-19 15:03:25,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-19 15:03:25,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-19 15:03:25,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-19 15:03:25,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 15:03:25,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 15:03:25,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-19 15:03:25,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-19 15:03:25,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-19 15:03:25,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-19 15:03:25,858 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 15:03:25,858 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 15:03:25,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 15:03:25,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 15:03:25,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-19 15:03:25,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-19 15:03:25,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-19 15:03:25,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-19 15:03:25,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 15:03:25,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 15:03:25,841 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-19 15:03:25,993 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 15:03:25,995 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 15:03:26,334 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 15:03:26,360 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 15:03:26,360 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 15:03:26,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:03:26 BoogieIcfgContainer [2023-12-19 15:03:26,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 15:03:26,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 15:03:26,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 15:03:26,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 15:03:26,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:03:25" (1/3) ... [2023-12-19 15:03:26,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d46aeed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:03:26, skipping insertion in model container [2023-12-19 15:03:26,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:03:25" (2/3) ... [2023-12-19 15:03:26,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d46aeed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:03:26, skipping insertion in model container [2023-12-19 15:03:26,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:03:26" (3/3) ... [2023-12-19 15:03:26,368 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-52.i [2023-12-19 15:03:26,382 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 15:03:26,382 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 15:03:26,420 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 15:03:26,426 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;@76d2a095, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 15:03:26,426 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 15:03:26,429 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 86 states have internal predecessors, (123), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-19 15:03:26,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-19 15:03:26,442 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:03:26,442 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:03:26,443 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:03:26,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:03:26,447 INFO L85 PathProgramCache]: Analyzing trace with hash 465918868, now seen corresponding path program 1 times [2023-12-19 15:03:26,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:03:26,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996739991] [2023-12-19 15:03:26,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:03:26,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:03:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:26,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:03:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:26,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:03:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:26,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:03:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:26,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:03:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:26,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:03:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:26,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:03:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:26,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:03:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:26,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:03:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:26,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:03:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:26,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:03:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:26,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:03:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:26,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:03:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:26,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:03:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:26,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:03:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:26,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:03:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:26,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:03:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:26,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:03:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:26,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:03:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:26,760 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:03:26,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:03:26,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996739991] [2023-12-19 15:03:26,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996739991] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:03:26,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:03:26,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 15:03:26,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912511975] [2023-12-19 15:03:26,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:03:26,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 15:03:26,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:03:26,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 15:03:26,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:03:26,791 INFO L87 Difference]: Start difference. First operand has 106 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 86 states have internal predecessors, (123), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-19 15:03:26,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:03:26,838 INFO L93 Difference]: Finished difference Result 209 states and 334 transitions. [2023-12-19 15:03:26,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 15:03:26,845 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2023-12-19 15:03:26,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:03:26,851 INFO L225 Difference]: With dead ends: 209 [2023-12-19 15:03:26,852 INFO L226 Difference]: Without dead ends: 104 [2023-12-19 15:03:26,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-19 15:03:26,857 INFO L413 NwaCegarLoop]: 150 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, 150 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-19 15:03:26,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:03:26,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-19 15:03:26,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-12-19 15:03:26,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 84 states have internal predecessors, (118), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-19 15:03:26,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2023-12-19 15:03:26,923 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 140 [2023-12-19 15:03:26,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:03:26,923 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2023-12-19 15:03:26,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-19 15:03:26,924 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2023-12-19 15:03:26,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-19 15:03:26,952 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:03:26,955 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:03:26,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 15:03:26,956 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:03:26,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:03:26,958 INFO L85 PathProgramCache]: Analyzing trace with hash -632948488, now seen corresponding path program 1 times [2023-12-19 15:03:26,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:03:26,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759351437] [2023-12-19 15:03:26,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:03:26,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:03:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:28,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:03:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:28,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:03:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:28,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:03:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:28,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:03:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:28,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:03:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:28,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:03:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:28,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:03:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:28,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:03:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:28,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:03:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:28,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:03:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:28,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:03:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:28,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:03:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:28,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:03:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:28,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:03:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:28,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:03:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:28,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:03:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:28,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:03:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:28,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:03:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:28,246 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-19 15:03:28,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:03:28,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759351437] [2023-12-19 15:03:28,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759351437] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:03:28,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860358015] [2023-12-19 15:03:28,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:03:28,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:03:28,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:03:28,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:03:28,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 15:03:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:28,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-19 15:03:28,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:03:28,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 57 [2023-12-19 15:03:29,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:03:29,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 251 treesize of output 171 [2023-12-19 15:03:29,104 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-19 15:03:29,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:03:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:03:29,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860358015] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-19 15:03:29,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-19 15:03:29,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 16 [2023-12-19 15:03:29,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505723337] [2023-12-19 15:03:29,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:03:29,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:03:29,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:03:29,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:03:29,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-12-19 15:03:29,355 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:03:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:03:29,573 INFO L93 Difference]: Finished difference Result 314 states and 465 transitions. [2023-12-19 15:03:29,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:03:29,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2023-12-19 15:03:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:03:29,580 INFO L225 Difference]: With dead ends: 314 [2023-12-19 15:03:29,581 INFO L226 Difference]: Without dead ends: 211 [2023-12-19 15:03:29,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2023-12-19 15:03:29,587 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 187 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:03:29,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 807 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:03:29,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-12-19 15:03:29,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 188. [2023-12-19 15:03:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 153 states have (on average 1.4052287581699345) internal successors, (215), 154 states have internal predecessors, (215), 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-19 15:03:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 279 transitions. [2023-12-19 15:03:29,626 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 279 transitions. Word has length 140 [2023-12-19 15:03:29,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:03:29,627 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 279 transitions. [2023-12-19 15:03:29,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:03:29,628 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 279 transitions. [2023-12-19 15:03:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-19 15:03:29,631 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:03:29,632 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:03:29,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-19 15:03:29,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:03:29,842 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:03:29,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:03:29,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1025975498, now seen corresponding path program 1 times [2023-12-19 15:03:29,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:03:29,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727203411] [2023-12-19 15:03:29,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:03:29,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:03:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:30,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:03:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:30,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:03:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:30,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:03:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:30,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:03:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:30,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:03:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:30,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:03:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:30,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:03:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:30,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:03:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:30,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:03:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:30,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:03:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:30,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:03:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:30,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:03:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:30,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:03:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:30,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:03:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:30,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:03:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:30,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:03:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:30,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:03:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:30,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-19 15:03:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:30,484 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-19 15:03:30,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:03:30,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727203411] [2023-12-19 15:03:30,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727203411] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:03:30,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362381042] [2023-12-19 15:03:30,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:03:30,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:03:30,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:03:30,487 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:03:30,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-19 15:03:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:03:30,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-19 15:03:30,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:03:30,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-19 15:03:31,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-19 15:03:31,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-19 15:03:31,098 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 233 proven. 39 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2023-12-19 15:03:31,099 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:03:31,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2023-12-19 15:03:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-19 15:03:31,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362381042] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 15:03:31,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 15:03:31,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2023-12-19 15:03:31,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893318860] [2023-12-19 15:03:31,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 15:03:31,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-19 15:03:31,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:03:31,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-19 15:03:31,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2023-12-19 15:03:31,371 INFO L87 Difference]: Start difference. First operand 188 states and 279 transitions. Second operand has 16 states, 12 states have (on average 8.666666666666666) internal successors, (104), 16 states have internal predecessors, (104), 8 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (38), 4 states have call predecessors, (38), 8 states have call successors, (38) [2023-12-19 15:03:31,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:03:31,817 INFO L93 Difference]: Finished difference Result 398 states and 582 transitions. [2023-12-19 15:03:31,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 15:03:31,818 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 8.666666666666666) internal successors, (104), 16 states have internal predecessors, (104), 8 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (38), 4 states have call predecessors, (38), 8 states have call successors, (38) Word has length 140 [2023-12-19 15:03:31,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:03:31,821 INFO L225 Difference]: With dead ends: 398 [2023-12-19 15:03:31,821 INFO L226 Difference]: Without dead ends: 211 [2023-12-19 15:03:31,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 304 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2023-12-19 15:03:31,828 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 417 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:03:31,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 678 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:03:31,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-12-19 15:03:31,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 204. [2023-12-19 15:03:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 163 states have (on average 1.3742331288343559) internal successors, (224), 165 states have internal predecessors, (224), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 15:03:31,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 296 transitions. [2023-12-19 15:03:31,856 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 296 transitions. Word has length 140 [2023-12-19 15:03:31,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:03:31,856 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 296 transitions. [2023-12-19 15:03:31,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 8.666666666666666) internal successors, (104), 16 states have internal predecessors, (104), 8 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (38), 4 states have call predecessors, (38), 8 states have call successors, (38) [2023-12-19 15:03:31,857 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 296 transitions. [2023-12-19 15:03:31,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-19 15:03:31,858 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:03:31,858 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:03:31,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-19 15:03:32,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-12-19 15:03:32,065 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:03:32,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:03:32,066 INFO L85 PathProgramCache]: Analyzing trace with hash -537420933, now seen corresponding path program 1 times [2023-12-19 15:03:32,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:03:32,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527672573] [2023-12-19 15:03:32,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:03:32,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:03:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:03:32,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 15:03:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:03:32,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 15:03:32,256 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 15:03:32,257 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 15:03:32,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 15:03:32,261 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-19 15:03:32,264 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 15:03:32,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:03:32 BoogieIcfgContainer [2023-12-19 15:03:32,349 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 15:03:32,350 INFO L158 Benchmark]: Toolchain (without parser) took 7024.72ms. Allocated memory was 275.8MB in the beginning and 362.8MB in the end (delta: 87.0MB). Free memory was 224.7MB in the beginning and 205.3MB in the end (delta: 19.5MB). Peak memory consumption was 107.5MB. Max. memory is 8.0GB. [2023-12-19 15:03:32,350 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory is still 144.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 15:03:32,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.14ms. Allocated memory is still 275.8MB. Free memory was 224.7MB in the beginning and 210.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-19 15:03:32,350 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.05ms. Allocated memory is still 275.8MB. Free memory was 210.1MB in the beginning and 206.4MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 15:03:32,351 INFO L158 Benchmark]: Boogie Preprocessor took 107.85ms. Allocated memory is still 275.8MB. Free memory was 206.4MB in the beginning and 201.7MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 15:03:32,351 INFO L158 Benchmark]: RCFGBuilder took 608.26ms. Allocated memory is still 275.8MB. Free memory was 201.7MB in the beginning and 168.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2023-12-19 15:03:32,351 INFO L158 Benchmark]: TraceAbstraction took 5986.43ms. Allocated memory was 275.8MB in the beginning and 362.8MB in the end (delta: 87.0MB). Free memory was 167.6MB in the beginning and 205.3MB in the end (delta: -37.7MB). Peak memory consumption was 50.9MB. Max. memory is 8.0GB. [2023-12-19 15:03:32,352 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.11ms. Allocated memory is still 190.8MB. Free memory is still 144.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 262.14ms. Allocated memory is still 275.8MB. Free memory was 224.7MB in the beginning and 210.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.05ms. Allocated memory is still 275.8MB. Free memory was 210.1MB in the beginning and 206.4MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 107.85ms. Allocated memory is still 275.8MB. Free memory was 206.4MB in the beginning and 201.7MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 608.26ms. Allocated memory is still 275.8MB. Free memory was 201.7MB in the beginning and 168.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 5986.43ms. Allocated memory was 275.8MB in the beginning and 362.8MB in the end (delta: 87.0MB). Free memory was 167.6MB in the beginning and 205.3MB in the end (delta: -37.7MB). Peak memory consumption was 50.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 98, overapproximation of someBinaryArithmeticDOUBLEoperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 0, 1 }; [L25-L27] double double_Array_0[5] = { 0.0, 31.1, 25.7, 256.5, 256.6 }; [L25-L27] double double_Array_0[5] = { 0.0, 31.1, 25.7, 256.5, 256.6 }; [L25-L27] double double_Array_0[5] = { 0.0, 31.1, 25.7, 256.5, 256.6 }; [L25-L27] double double_Array_0[5] = { 0.0, 31.1, 25.7, 256.5, 256.6 }; [L25-L27] double double_Array_0[5] = { 0.0, 31.1, 25.7, 256.5, 256.6 }; [L25-L27] double double_Array_0[5] = { 0.0, 31.1, 25.7, 256.5, 256.6 }; [L28-L30] signed short int signed_short_int_Array_0[3] = { -1, 32, -4 }; [L28-L30] signed short int signed_short_int_Array_0[3] = { -1, 32, -4 }; [L28-L30] signed short int signed_short_int_Array_0[3] = { -1, 32, -4 }; [L28-L30] signed short int signed_short_int_Array_0[3] = { -1, 32, -4 }; [L31-L33] unsigned char unsigned_char_Array_0[1] = { 16 }; [L31-L33] unsigned char unsigned_char_Array_0[1] = { 16 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 8 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 8 }; [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] FCALL updateLastVariables() [L106] CALL updateVariables() [L65] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L68] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] 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}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] 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}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] 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}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] 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}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] BOOL_unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] double_Array_0[0] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[0] [L78] EXPR double_Array_0[0] >= 4611686.018427382800e+12F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR double_Array_0[0] >= 4611686.018427382800e+12F && double_Array_0[0] <= -1.0e-20F [L78] EXPR double_Array_0[0] [L78] EXPR double_Array_0[0] >= 4611686.018427382800e+12F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (double_Array_0[0] >= 4611686.018427382800e+12F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (double_Array_0[0] >= 4611686.018427382800e+12F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] CALL assume_abort_if_not((double_Array_0[0] >= 4611686.018427382800e+12F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] RET assume_abort_if_not((double_Array_0[0] >= 4611686.018427382800e+12F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] double_Array_0[1] = __VERIFIER_nondet_double() [L80] EXPR double_Array_0[1] [L80] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L80] EXPR double_Array_0[1] [L80] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] double_Array_0[3] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[3] [L82] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F [L82] EXPR double_Array_0[3] [L82] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] CALL assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] RET assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] double_Array_0[4] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[4] [L84] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F [L84] EXPR double_Array_0[4] [L84] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] CALL assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] RET assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L86] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L89] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] RET assume_abort_if_not(signed_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L92] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 30) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 30) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] RET updateVariables() [L107] CALL step() [L40] EXPR signed_short_int_Array_0[1] [L40] signed short int stepLocal_0 = signed_short_int_Array_0[1]; [L41] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L41] COND FALSE !(stepLocal_0 > ((signed_short_int_Array_0[0] / -256) * 32)) [L48] EXPR BOOL_unsigned_char_Array_0[0] [L48] BOOL_unsigned_char_Array_0[4] = BOOL_unsigned_char_Array_0[0] [L50] BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L50] COND TRUE BOOL_unsigned_char_Array_0[2] [L51] EXPR double_Array_0[3] [L51] EXPR double_Array_0[0] [L51] EXPR double_Array_0[1] [L51] EXPR double_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L51] EXPR (((double_Array_0[0] - double_Array_0[1])) > (double_Array_0[4])) ? ((double_Array_0[0] - double_Array_0[1])) : (double_Array_0[4]) [L51] EXPR double_Array_0[0] [L51] EXPR double_Array_0[1] [L51] EXPR (((double_Array_0[0] - double_Array_0[1])) > (double_Array_0[4])) ? ((double_Array_0[0] - double_Array_0[1])) : (double_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, stepLocal_0=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L51] double_Array_0[2] = (double_Array_0[3] - (((((double_Array_0[0] - double_Array_0[1])) > (double_Array_0[4])) ? ((double_Array_0[0] - double_Array_0[1])) : (double_Array_0[4])))) [L53] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L53] COND TRUE double_Array_0[2] < 63.75 [L54] EXPR signed_short_int_Array_0[1] [L54] signed_short_int_Array_0[2] = (10 - signed_short_int_Array_0[1]) [L58] EXPR double_Array_0[1] [L58] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L58] COND FALSE !(! (double_Array_0[1] < (127.125 / double_Array_0[0]))) [L107] RET step() [L108] CALL, EXPR property() [L98] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR (double_Array_0[2] < 63.75) ? (signed_short_int_Array_0[2] == ((signed short int) (10 - signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[2] == ((signed short int) (4 + signed_short_int_Array_0[0]))) [L98] EXPR signed_short_int_Array_0[2] [L98] EXPR signed_short_int_Array_0[0] [L98] EXPR (double_Array_0[2] < 63.75) ? (signed_short_int_Array_0[2] == ((signed short int) (10 - signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[2] == ((signed short int) (4 + signed_short_int_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR ((double_Array_0[2] < 63.75) ? (signed_short_int_Array_0[2] == ((signed short int) (10 - signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[2] == ((signed short int) (4 + signed_short_int_Array_0[0])))) && ((signed_short_int_Array_0[1] > ((signed_short_int_Array_0[0] / -256) * 32)) ? (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR ((double_Array_0[2] < 63.75) ? (signed_short_int_Array_0[2] == ((signed short int) (10 - signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[2] == ((signed short int) (4 + signed_short_int_Array_0[0])))) && ((signed_short_int_Array_0[1] > ((signed_short_int_Array_0[0] / -256) * 32)) ? (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR (((double_Array_0[2] < 63.75) ? (signed_short_int_Array_0[2] == ((signed short int) (10 - signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[2] == ((signed short int) (4 + signed_short_int_Array_0[0])))) && ((signed_short_int_Array_0[1] > ((signed_short_int_Array_0[0] / -256) * 32)) ? (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0])))) && (BOOL_unsigned_char_Array_0[2] ? (double_Array_0[2] == ((double) (double_Array_0[3] - (((((double_Array_0[0] - double_Array_0[1])) > (double_Array_0[4])) ? ((double_Array_0[0] - double_Array_0[1])) : (double_Array_0[4])))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR (((double_Array_0[2] < 63.75) ? (signed_short_int_Array_0[2] == ((signed short int) (10 - signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[2] == ((signed short int) (4 + signed_short_int_Array_0[0])))) && ((signed_short_int_Array_0[1] > ((signed_short_int_Array_0[0] / -256) * 32)) ? (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0])))) && (BOOL_unsigned_char_Array_0[2] ? (double_Array_0[2] == ((double) (double_Array_0[3] - (((((double_Array_0[0] - double_Array_0[1])) > (double_Array_0[4])) ? ((double_Array_0[0] - double_Array_0[1])) : (double_Array_0[4])))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR ((((double_Array_0[2] < 63.75) ? (signed_short_int_Array_0[2] == ((signed short int) (10 - signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[2] == ((signed short int) (4 + signed_short_int_Array_0[0])))) && ((signed_short_int_Array_0[1] > ((signed_short_int_Array_0[0] / -256) * 32)) ? (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0])))) && (BOOL_unsigned_char_Array_0[2] ? (double_Array_0[2] == ((double) (double_Array_0[3] - (((((double_Array_0[0] - double_Array_0[1])) > (double_Array_0[4])) ? ((double_Array_0[0] - double_Array_0[1])) : (double_Array_0[4])))))) : 1)) && ((! (double_Array_0[1] < (127.125 / double_Array_0[0]))) ? ((signed_short_int_Array_0[2] <= ((signed_short_int_Array_0[0] * signed_short_int_Array_0[1]) + (-2 << unsigned_char_Array_0[0]))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_short_int_Array_0[1])) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR ((((double_Array_0[2] < 63.75) ? (signed_short_int_Array_0[2] == ((signed short int) (10 - signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[2] == ((signed short int) (4 + signed_short_int_Array_0[0])))) && ((signed_short_int_Array_0[1] > ((signed_short_int_Array_0[0] / -256) * 32)) ? (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0])))) && (BOOL_unsigned_char_Array_0[2] ? (double_Array_0[2] == ((double) (double_Array_0[3] - (((((double_Array_0[0] - double_Array_0[1])) > (double_Array_0[4])) ? ((double_Array_0[0] - double_Array_0[1])) : (double_Array_0[4])))))) : 1)) && ((! (double_Array_0[1] < (127.125 / double_Array_0[0]))) ? ((signed_short_int_Array_0[2] <= ((signed_short_int_Array_0[0] * signed_short_int_Array_0[1]) + (-2 << unsigned_char_Array_0[0]))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_short_int_Array_0[1])) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98-L99] return ((((double_Array_0[2] < 63.75) ? (signed_short_int_Array_0[2] == ((signed short int) (10 - signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[2] == ((signed short int) (4 + signed_short_int_Array_0[0])))) && ((signed_short_int_Array_0[1] > ((signed_short_int_Array_0[0] / -256) * 32)) ? (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0])))) && (BOOL_unsigned_char_Array_0[2] ? (double_Array_0[2] == ((double) (double_Array_0[3] - (((((double_Array_0[0] - double_Array_0[1])) > (double_Array_0[4])) ? ((double_Array_0[0] - double_Array_0[1])) : (double_Array_0[4])))))) : 1)) && ((! (double_Array_0[1] < (127.125 / double_Array_0[0]))) ? ((signed_short_int_Array_0[2] <= ((signed_short_int_Array_0[0] * signed_short_int_Array_0[1]) + (-2 << unsigned_char_Array_0[0]))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_short_int_Array_0[1])) : 1) : 1) ; [L108] RET, EXPR property() [L108] 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}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 609 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 604 mSDsluCounter, 1635 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1137 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 535 IncrementalHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 498 mSDtfsCounter, 535 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 714 GetRequests, 670 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=3, InterpolantAutomatonStates: 23, 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, 3 MinimizatonAttempts, 30 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 842 NumberOfCodeBlocks, 842 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 973 ConstructedInterpolants, 0 QuantifiedInterpolants, 5992 SizeOfPredicates, 16 NumberOfNonLiveVariables, 928 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 4077/4284 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-19 15:03:32,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...