/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-92.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:32:04,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:32:04,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:32:04,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:32:04,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:32:04,358 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:32:04,359 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:32:04,359 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:32:04,360 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:32:04,363 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:32:04,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:32:04,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:32:04,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:32:04,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:32:04,366 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:32:04,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:32:04,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:32:04,366 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:32:04,367 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:32:04,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:32:04,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:32:04,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:32:04,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:32:04,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:32:04,368 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:32:04,369 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:32:04,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:32:04,369 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:32:04,370 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:32:04,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:32:04,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:32:04,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:32:04,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:32:04,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:32:04,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:32:04,371 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:32:04,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:32:04,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:32:04,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:32:04,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:32:04,372 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:32:04,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:32:04,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:32:04,373 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:32:04,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:32:04,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:32:04,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:32:04,644 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:32:04,644 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:32:04,645 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-92.i [2023-12-15 21:32:05,836 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:32:06,067 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:32:06,067 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.i [2023-12-15 21:32:06,075 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/705db0e65/fbbab29378d242fe976b5428e0b87e3a/FLAG9b830b6ab [2023-12-15 21:32:06,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/705db0e65/fbbab29378d242fe976b5428e0b87e3a [2023-12-15 21:32:06,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:32:06,095 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:32:06,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:32:06,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:32:06,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:32:06,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:32:06" (1/1) ... [2023-12-15 21:32:06,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9069e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:06, skipping insertion in model container [2023-12-15 21:32:06,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:32:06" (1/1) ... [2023-12-15 21:32:06,147 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:32:06,262 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-92.i[916,929] [2023-12-15 21:32:06,318 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:32:06,330 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:32:06,340 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-92.i[916,929] [2023-12-15 21:32:06,376 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:32:06,392 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:32:06,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:06 WrapperNode [2023-12-15 21:32:06,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:32:06,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:32:06,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:32:06,394 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:32:06,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:06" (1/1) ... [2023-12-15 21:32:06,414 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:06" (1/1) ... [2023-12-15 21:32:06,479 INFO L138 Inliner]: procedures = 29, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 461 [2023-12-15 21:32:06,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:32:06,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:32:06,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:32:06,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:32:06,489 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:06" (1/1) ... [2023-12-15 21:32:06,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:06" (1/1) ... [2023-12-15 21:32:06,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:06" (1/1) ... [2023-12-15 21:32:06,527 INFO L175 MemorySlicer]: Split 123 memory accesses to 7 slices as follows [2, 21, 23, 3, 61, 3, 10]. 50 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 3, 3, 1, 6, 1, 2]. The 18 writes are split as follows [0, 4, 4, 1, 6, 1, 2]. [2023-12-15 21:32:06,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:06" (1/1) ... [2023-12-15 21:32:06,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:06" (1/1) ... [2023-12-15 21:32:06,558 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:06" (1/1) ... [2023-12-15 21:32:06,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:06" (1/1) ... [2023-12-15 21:32:06,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:06" (1/1) ... [2023-12-15 21:32:06,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:06" (1/1) ... [2023-12-15 21:32:06,574 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:32:06,575 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:32:06,575 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:32:06,575 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:32:06,576 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:06" (1/1) ... [2023-12-15 21:32:06,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:32:06,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:32:06,638 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 21:32:06,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 21:32:06,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:32:06,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-15 21:32:06,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-15 21:32:06,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-15 21:32:06,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-15 21:32:06,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-15 21:32:06,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-15 21:32:06,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-15 21:32:06,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:32:06,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:32:06,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 21:32:06,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-15 21:32:06,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-15 21:32:06,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-15 21:32:06,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-15 21:32:06,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-15 21:32:06,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-15 21:32:06,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-15 21:32:06,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-15 21:32:06,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-15 21:32:06,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-15 21:32:06,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-15 21:32:06,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:32:06,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:32:06,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-15 21:32:06,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-15 21:32:06,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-15 21:32:06,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-15 21:32:06,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-15 21:32:06,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-15 21:32:06,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-15 21:32:06,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-15 21:32:06,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-15 21:32:06,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-15 21:32:06,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-15 21:32:06,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-15 21:32:06,677 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:32:06,677 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:32:06,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:32:06,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:32:06,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 21:32:06,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 21:32:06,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-15 21:32:06,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-15 21:32:06,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-15 21:32:06,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:32:06,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:32:06,835 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:32:06,837 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:32:07,192 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:32:07,219 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:32:07,219 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:32:07,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:32:07 BoogieIcfgContainer [2023-12-15 21:32:07,220 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:32:07,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:32:07,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:32:07,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:32:07,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:32:06" (1/3) ... [2023-12-15 21:32:07,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0553cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:32:07, skipping insertion in model container [2023-12-15 21:32:07,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:06" (2/3) ... [2023-12-15 21:32:07,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0553cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:32:07, skipping insertion in model container [2023-12-15 21:32:07,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:32:07" (3/3) ... [2023-12-15 21:32:07,227 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-92.i [2023-12-15 21:32:07,242 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:32:07,242 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:32:07,285 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:32:07,290 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;@558904ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:32:07,291 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:32:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 83 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-15 21:32:07,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-15 21:32:07,307 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:07,307 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:07,308 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:07,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:07,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2137065474, now seen corresponding path program 1 times [2023-12-15 21:32:07,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:07,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152027328] [2023-12-15 21:32:07,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:07,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:07,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:07,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152027328] [2023-12-15 21:32:07,561 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-15 21:32:07,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816572523] [2023-12-15 21:32:07,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:07,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:32:07,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:32:07,565 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-15 21:32:07,595 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-15 21:32:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:07,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-15 21:32:07,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:32:07,838 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2023-12-15 21:32:07,839 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:32:07,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816572523] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:07,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:07,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:32:07,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333900722] [2023-12-15 21:32:07,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:07,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:32:07,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:07,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:32:07,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:32:07,873 INFO L87 Difference]: Start difference. First operand has 104 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 83 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-15 21:32:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:07,933 INFO L93 Difference]: Finished difference Result 205 states and 325 transitions. [2023-12-15 21:32:07,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:32:07,935 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 148 [2023-12-15 21:32:07,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:07,943 INFO L225 Difference]: With dead ends: 205 [2023-12-15 21:32:07,943 INFO L226 Difference]: Without dead ends: 102 [2023-12-15 21:32:07,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:32:07,950 INFO L413 NwaCegarLoop]: 145 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, 145 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:07,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:32:07,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-15 21:32:07,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-12-15 21:32:07,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-15 21:32:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2023-12-15 21:32:07,994 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 148 [2023-12-15 21:32:07,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:07,995 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2023-12-15 21:32:07,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-15 21:32:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2023-12-15 21:32:07,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-15 21:32:07,999 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:08,000 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:08,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 21:32:08,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-15 21:32:08,207 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:08,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:08,207 INFO L85 PathProgramCache]: Analyzing trace with hash 950306528, now seen corresponding path program 1 times [2023-12-15 21:32:08,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:08,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328592938] [2023-12-15 21:32:08,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:08,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:08,307 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:32:08,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1993752766] [2023-12-15 21:32:08,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:08,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:32:08,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:32:08,314 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-15 21:32:08,332 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-15 21:32:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:08,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 21:32:08,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:32:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-15 21:32:08,605 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:32:08,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:08,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328592938] [2023-12-15 21:32:08,606 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:32:08,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993752766] [2023-12-15 21:32:08,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993752766] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:08,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:08,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:32:08,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702076809] [2023-12-15 21:32:08,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:08,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:32:08,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:08,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:32:08,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:32:08,609 INFO L87 Difference]: Start difference. First operand 102 states and 149 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-15 21:32:08,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:08,658 INFO L93 Difference]: Finished difference Result 207 states and 302 transitions. [2023-12-15 21:32:08,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:32:08,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2023-12-15 21:32:08,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:08,660 INFO L225 Difference]: With dead ends: 207 [2023-12-15 21:32:08,660 INFO L226 Difference]: Without dead ends: 106 [2023-12-15 21:32:08,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:32:08,662 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 3 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:08,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 423 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:32:08,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-15 21:32:08,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2023-12-15 21:32:08,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-15 21:32:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2023-12-15 21:32:08,674 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 148 [2023-12-15 21:32:08,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:08,676 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2023-12-15 21:32:08,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-15 21:32:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2023-12-15 21:32:08,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-15 21:32:08,679 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:08,679 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:08,687 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-15 21:32:08,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-15 21:32:08,885 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:08,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:08,885 INFO L85 PathProgramCache]: Analyzing trace with hash 950366110, now seen corresponding path program 1 times [2023-12-15 21:32:08,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:08,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598375530] [2023-12-15 21:32:08,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:08,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:08,956 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:32:08,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [776916483] [2023-12-15 21:32:08,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:08,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:32:08,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:32:08,965 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:32:08,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 21:32:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:09,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-15 21:32:09,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:32:09,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 61 [2023-12-15 21:32:09,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 81 [2023-12-15 21:32:10,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-12-15 21:32:10,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-12-15 21:32:10,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:32:10,447 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 57 treesize of output 29 [2023-12-15 21:32:10,458 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 270 proven. 12 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2023-12-15 21:32:10,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:32:11,168 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-12-15 21:32:11,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:11,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598375530] [2023-12-15 21:32:11,169 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:32:11,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776916483] [2023-12-15 21:32:11,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776916483] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:32:11,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:32:11,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2023-12-15 21:32:11,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907546327] [2023-12-15 21:32:11,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 21:32:11,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-15 21:32:11,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:11,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-15 21:32:11,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:32:11,174 INFO L87 Difference]: Start difference. First operand 104 states and 151 transitions. Second operand has 13 states, 11 states have (on average 9.181818181818182) internal successors, (101), 13 states have internal predecessors, (101), 6 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) [2023-12-15 21:32:11,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:11,626 INFO L93 Difference]: Finished difference Result 219 states and 311 transitions. [2023-12-15 21:32:11,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-15 21:32:11,626 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 9.181818181818182) internal successors, (101), 13 states have internal predecessors, (101), 6 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) Word has length 148 [2023-12-15 21:32:11,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:11,628 INFO L225 Difference]: With dead ends: 219 [2023-12-15 21:32:11,628 INFO L226 Difference]: Without dead ends: 116 [2023-12-15 21:32:11,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2023-12-15 21:32:11,630 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 299 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:11,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 413 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:32:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-15 21:32:11,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2023-12-15 21:32:11,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-15 21:32:11,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2023-12-15 21:32:11,642 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 148 [2023-12-15 21:32:11,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:11,643 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2023-12-15 21:32:11,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 9.181818181818182) internal successors, (101), 13 states have internal predecessors, (101), 6 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) [2023-12-15 21:32:11,643 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2023-12-15 21:32:11,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-15 21:32:11,645 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:11,645 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:11,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 21:32:11,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:32:11,853 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:11,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:11,853 INFO L85 PathProgramCache]: Analyzing trace with hash 132717660, now seen corresponding path program 1 times [2023-12-15 21:32:11,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:11,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989133169] [2023-12-15 21:32:11,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:11,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:11,920 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:32:11,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [453396191] [2023-12-15 21:32:11,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:11,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:32:11,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:32:11,927 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:32:11,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-15 21:32:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:12,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-15 21:32:12,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:32:12,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 149 [2023-12-15 21:32:12,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 143 [2023-12-15 21:32:12,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 58 [2023-12-15 21:32:12,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:32:12,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 58 [2023-12-15 21:32:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-15 21:32:12,703 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:32:12,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:12,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989133169] [2023-12-15 21:32:12,703 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:32:12,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453396191] [2023-12-15 21:32:12,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453396191] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:12,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:12,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:32:12,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216208657] [2023-12-15 21:32:12,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:12,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:32:12,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:12,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:32:12,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:32:12,706 INFO L87 Difference]: Start difference. First operand 112 states and 156 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-15 21:32:13,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:13,307 INFO L93 Difference]: Finished difference Result 335 states and 472 transitions. [2023-12-15 21:32:13,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:32:13,308 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2023-12-15 21:32:13,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:13,310 INFO L225 Difference]: With dead ends: 335 [2023-12-15 21:32:13,310 INFO L226 Difference]: Without dead ends: 224 [2023-12-15 21:32:13,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:32:13,311 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 303 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:13,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 862 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:32:13,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-12-15 21:32:13,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 195. [2023-12-15 21:32:13,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 161 states have (on average 1.3540372670807452) internal successors, (218), 162 states have internal predecessors, (218), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-15 21:32:13,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 276 transitions. [2023-12-15 21:32:13,331 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 276 transitions. Word has length 148 [2023-12-15 21:32:13,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:13,332 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 276 transitions. [2023-12-15 21:32:13,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-15 21:32:13,332 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 276 transitions. [2023-12-15 21:32:13,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-15 21:32:13,334 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:13,334 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:13,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-15 21:32:13,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:32:13,542 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:13,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:13,543 INFO L85 PathProgramCache]: Analyzing trace with hash -878399590, now seen corresponding path program 1 times [2023-12-15 21:32:13,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:13,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707434600] [2023-12-15 21:32:13,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:13,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:13,578 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:32:13,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [404097188] [2023-12-15 21:32:13,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:13,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:32:13,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:32:13,580 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:32:13,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-15 21:32:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:13,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-15 21:32:13,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:32:13,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 68 [2023-12-15 21:32:14,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 104 [2023-12-15 21:32:14,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2023-12-15 21:32:14,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:32:14,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 41 [2023-12-15 21:32:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-15 21:32:14,596 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:32:14,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:14,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707434600] [2023-12-15 21:32:14,596 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:32:14,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404097188] [2023-12-15 21:32:14,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404097188] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:14,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:14,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:32:14,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182097170] [2023-12-15 21:32:14,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:14,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:32:14,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:14,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:32:14,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:32:14,599 INFO L87 Difference]: Start difference. First operand 195 states and 276 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-15 21:32:14,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:14,914 INFO L93 Difference]: Finished difference Result 421 states and 593 transitions. [2023-12-15 21:32:14,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:32:14,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2023-12-15 21:32:14,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:14,918 INFO L225 Difference]: With dead ends: 421 [2023-12-15 21:32:14,918 INFO L226 Difference]: Without dead ends: 227 [2023-12-15 21:32:14,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:32:14,919 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 342 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:14,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 530 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:32:14,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-12-15 21:32:14,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 197. [2023-12-15 21:32:14,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 162 states have (on average 1.3395061728395061) internal successors, (217), 163 states have internal predecessors, (217), 29 states have call successors, (29), 5 states have call predecessors, (29), 5 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-15 21:32:14,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 275 transitions. [2023-12-15 21:32:14,938 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 275 transitions. Word has length 148 [2023-12-15 21:32:14,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:14,938 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 275 transitions. [2023-12-15 21:32:14,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-15 21:32:14,939 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 275 transitions. [2023-12-15 21:32:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-15 21:32:14,940 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:14,941 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:14,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-15 21:32:15,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:32:15,148 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:15,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:15,149 INFO L85 PathProgramCache]: Analyzing trace with hash 194757274, now seen corresponding path program 1 times [2023-12-15 21:32:15,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:15,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647486148] [2023-12-15 21:32:15,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:15,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:15,181 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:32:15,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1470413732] [2023-12-15 21:32:15,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:15,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:32:15,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:32:15,183 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:32:15,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-15 21:32:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:15,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-15 21:32:15,392 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:32:15,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 67 [2023-12-15 21:32:15,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 103 [2023-12-15 21:32:16,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2023-12-15 21:32:16,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 76 [2023-12-15 21:32:16,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:32:16,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 39 [2023-12-15 21:32:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-15 21:32:16,277 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:32:16,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:16,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647486148] [2023-12-15 21:32:16,277 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:32:16,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470413732] [2023-12-15 21:32:16,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470413732] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:16,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:16,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:32:16,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031372726] [2023-12-15 21:32:16,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:16,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:32:16,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:16,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:32:16,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:32:16,279 INFO L87 Difference]: Start difference. First operand 197 states and 275 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-15 21:32:16,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:16,552 INFO L93 Difference]: Finished difference Result 399 states and 553 transitions. [2023-12-15 21:32:16,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:32:16,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2023-12-15 21:32:16,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:16,554 INFO L225 Difference]: With dead ends: 399 [2023-12-15 21:32:16,554 INFO L226 Difference]: Without dead ends: 203 [2023-12-15 21:32:16,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:32:16,555 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 294 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:16,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 439 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:32:16,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-12-15 21:32:16,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2023-12-15 21:32:16,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 165 states have (on average 1.3272727272727274) internal successors, (219), 166 states have internal predecessors, (219), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-15 21:32:16,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 277 transitions. [2023-12-15 21:32:16,574 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 277 transitions. Word has length 148 [2023-12-15 21:32:16,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:16,575 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 277 transitions. [2023-12-15 21:32:16,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-15 21:32:16,575 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 277 transitions. [2023-12-15 21:32:16,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-15 21:32:16,576 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:16,576 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:16,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-15 21:32:16,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:32:16,784 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:16,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:16,785 INFO L85 PathProgramCache]: Analyzing trace with hash -816359976, now seen corresponding path program 1 times [2023-12-15 21:32:16,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:16,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517492550] [2023-12-15 21:32:16,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:16,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:16,823 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:32:16,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [506535210] [2023-12-15 21:32:16,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:16,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:32:16,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:32:16,842 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:32:16,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-15 21:32:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:17,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-15 21:32:17,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:32:17,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 99 [2023-12-15 21:32:17,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 61 [2023-12-15 21:32:17,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 59 [2023-12-15 21:32:17,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:32:17,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 164 treesize of output 72 [2023-12-15 21:32:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-15 21:32:17,641 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:32:17,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:17,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517492550] [2023-12-15 21:32:17,641 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:32:17,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506535210] [2023-12-15 21:32:17,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506535210] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:17,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:17,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:32:17,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294089512] [2023-12-15 21:32:17,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:17,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:32:17,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:17,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:32:17,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:32:17,643 INFO L87 Difference]: Start difference. First operand 201 states and 277 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-15 21:32:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:18,131 INFO L93 Difference]: Finished difference Result 430 states and 592 transitions. [2023-12-15 21:32:18,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:32:18,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2023-12-15 21:32:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:18,133 INFO L225 Difference]: With dead ends: 430 [2023-12-15 21:32:18,133 INFO L226 Difference]: Without dead ends: 230 [2023-12-15 21:32:18,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:32:18,135 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 251 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:18,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 952 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:32:18,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-12-15 21:32:18,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 201. [2023-12-15 21:32:18,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 165 states have (on average 1.3212121212121213) internal successors, (218), 166 states have internal predecessors, (218), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-15 21:32:18,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 276 transitions. [2023-12-15 21:32:18,152 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 276 transitions. Word has length 148 [2023-12-15 21:32:18,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:18,152 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 276 transitions. [2023-12-15 21:32:18,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-15 21:32:18,153 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 276 transitions. [2023-12-15 21:32:18,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-15 21:32:18,154 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:18,154 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:18,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-15 21:32:18,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:32:18,365 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:18,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:18,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1483475228, now seen corresponding path program 1 times [2023-12-15 21:32:18,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:18,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994411887] [2023-12-15 21:32:18,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:18,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:18,396 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:32:18,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1931178452] [2023-12-15 21:32:18,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:18,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:32:18,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:32:18,397 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:32:18,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-15 21:32:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:18,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-15 21:32:18,627 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:32:18,740 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 23 treesize of output 11 [2023-12-15 21:32:18,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:32:18,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2023-12-15 21:32:18,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:32:18,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2023-12-15 21:32:18,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:32:18,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2023-12-15 21:32:19,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 66 [2023-12-15 21:32:19,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 94 [2023-12-15 21:32:19,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2023-12-15 21:32:19,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:32:19,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 44 [2023-12-15 21:32:19,971 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 374 proven. 63 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2023-12-15 21:32:19,971 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:32:20,853 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 39 proven. 66 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2023-12-15 21:32:20,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:20,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994411887] [2023-12-15 21:32:20,854 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:32:20,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931178452] [2023-12-15 21:32:20,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931178452] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:32:20,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:32:20,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2023-12-15 21:32:20,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308037838] [2023-12-15 21:32:20,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 21:32:20,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-15 21:32:20,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:20,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-15 21:32:20,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2023-12-15 21:32:20,865 INFO L87 Difference]: Start difference. First operand 201 states and 276 transitions. Second operand has 29 states, 25 states have (on average 4.84) internal successors, (121), 29 states have internal predecessors, (121), 11 states have call successors, (38), 4 states have call predecessors, (38), 8 states have return successors, (38), 7 states have call predecessors, (38), 11 states have call successors, (38) [2023-12-15 21:32:21,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:21,941 INFO L93 Difference]: Finished difference Result 512 states and 691 transitions. [2023-12-15 21:32:21,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-15 21:32:21,942 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 4.84) internal successors, (121), 29 states have internal predecessors, (121), 11 states have call successors, (38), 4 states have call predecessors, (38), 8 states have return successors, (38), 7 states have call predecessors, (38), 11 states have call successors, (38) Word has length 152 [2023-12-15 21:32:21,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:21,944 INFO L225 Difference]: With dead ends: 512 [2023-12-15 21:32:21,944 INFO L226 Difference]: Without dead ends: 300 [2023-12-15 21:32:21,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=456, Invalid=1436, Unknown=0, NotChecked=0, Total=1892 [2023-12-15 21:32:21,946 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 1285 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:21,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 1056 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-15 21:32:21,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-12-15 21:32:21,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 219. [2023-12-15 21:32:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 179 states have (on average 1.2960893854748603) internal successors, (232), 180 states have internal predecessors, (232), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-15 21:32:21,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 290 transitions. [2023-12-15 21:32:21,964 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 290 transitions. Word has length 152 [2023-12-15 21:32:21,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:21,964 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 290 transitions. [2023-12-15 21:32:21,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 4.84) internal successors, (121), 29 states have internal predecessors, (121), 11 states have call successors, (38), 4 states have call predecessors, (38), 8 states have return successors, (38), 7 states have call predecessors, (38), 11 states have call successors, (38) [2023-12-15 21:32:21,965 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 290 transitions. [2023-12-15 21:32:21,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-15 21:32:21,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:21,966 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:21,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-15 21:32:22,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-15 21:32:22,174 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:22,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:22,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1421435614, now seen corresponding path program 1 times [2023-12-15 21:32:22,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:22,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044274017] [2023-12-15 21:32:22,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:22,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:22,209 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:32:22,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1773149346] [2023-12-15 21:32:22,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:22,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:32:22,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:32:22,210 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:32:22,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-15 21:32:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:22,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-15 21:32:22,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:32:22,582 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 23 treesize of output 11 [2023-12-15 21:32:22,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:32:22,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2023-12-15 21:32:22,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:32:22,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2023-12-15 21:32:22,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:32:22,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2023-12-15 21:32:22,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 66 [2023-12-15 21:32:22,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 94 [2023-12-15 21:32:23,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2023-12-15 21:32:23,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:32:23,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 41 [2023-12-15 21:32:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 374 proven. 63 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2023-12-15 21:32:23,678 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:32:31,525 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 39 proven. 66 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2023-12-15 21:32:31,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:31,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044274017] [2023-12-15 21:32:31,525 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:32:31,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773149346] [2023-12-15 21:32:31,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773149346] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:32:31,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:32:31,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2023-12-15 21:32:31,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022625221] [2023-12-15 21:32:31,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 21:32:31,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-15 21:32:31,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:31,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-15 21:32:31,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=633, Unknown=1, NotChecked=0, Total=812 [2023-12-15 21:32:31,528 INFO L87 Difference]: Start difference. First operand 219 states and 290 transitions. Second operand has 29 states, 25 states have (on average 5.04) internal successors, (126), 29 states have internal predecessors, (126), 11 states have call successors, (38), 4 states have call predecessors, (38), 8 states have return successors, (38), 7 states have call predecessors, (38), 11 states have call successors, (38) [2023-12-15 21:32:32,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:32,930 INFO L93 Difference]: Finished difference Result 470 states and 621 transitions. [2023-12-15 21:32:32,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-15 21:32:32,930 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 5.04) internal successors, (126), 29 states have internal predecessors, (126), 11 states have call successors, (38), 4 states have call predecessors, (38), 8 states have return successors, (38), 7 states have call predecessors, (38), 11 states have call successors, (38) Word has length 152 [2023-12-15 21:32:32,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:32,932 INFO L225 Difference]: With dead ends: 470 [2023-12-15 21:32:32,932 INFO L226 Difference]: Without dead ends: 252 [2023-12-15 21:32:32,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=738, Invalid=2567, Unknown=1, NotChecked=0, Total=3306 [2023-12-15 21:32:32,934 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 650 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:32,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 1098 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-15 21:32:32,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-12-15 21:32:32,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 221. [2023-12-15 21:32:32,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 181 states have (on average 1.292817679558011) internal successors, (234), 182 states have internal predecessors, (234), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-15 21:32:32,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 292 transitions. [2023-12-15 21:32:32,951 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 292 transitions. Word has length 152 [2023-12-15 21:32:32,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:32,952 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 292 transitions. [2023-12-15 21:32:32,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 5.04) internal successors, (126), 29 states have internal predecessors, (126), 11 states have call successors, (38), 4 states have call predecessors, (38), 8 states have return successors, (38), 7 states have call predecessors, (38), 11 states have call successors, (38) [2023-12-15 21:32:32,952 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 292 transitions. [2023-12-15 21:32:32,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-15 21:32:32,953 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:32,954 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:32,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-15 21:32:33,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:32:33,161 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:33,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:33,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2008241628, now seen corresponding path program 1 times [2023-12-15 21:32:33,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:33,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851254912] [2023-12-15 21:32:33,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:33,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:33,198 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:32:33,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1294014930] [2023-12-15 21:32:33,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:33,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:32:33,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:32:33,202 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:32:33,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-15 21:32:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:33,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-15 21:32:33,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:32:33,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-15 21:32:33,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-15 21:32:33,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-15 21:32:33,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-15 21:32:33,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2023-12-15 21:32:33,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 89 [2023-12-15 21:32:33,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-15 21:32:34,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:32:34,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 95 [2023-12-15 21:32:34,090 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 82 treesize of output 52 [2023-12-15 21:32:34,149 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 354 proven. 33 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2023-12-15 21:32:34,149 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:32:34,947 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 70 treesize of output 46 [2023-12-15 21:32:35,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:35,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851254912] [2023-12-15 21:32:35,047 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:32:35,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294014930] [2023-12-15 21:32:35,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294014930] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:32:35,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:32:35,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2023-12-15 21:32:35,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700812949] [2023-12-15 21:32:35,048 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-15 21:32:35,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 21:32:35,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:35,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 21:32:35,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-12-15 21:32:35,049 INFO L87 Difference]: Start difference. First operand 221 states and 292 transitions. Second operand has 12 states, 10 states have (on average 6.9) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-15 21:32:35,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:35,636 INFO L93 Difference]: Finished difference Result 447 states and 589 transitions. [2023-12-15 21:32:35,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-15 21:32:35,636 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.9) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 152 [2023-12-15 21:32:35,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:35,638 INFO L225 Difference]: With dead ends: 447 [2023-12-15 21:32:35,638 INFO L226 Difference]: Without dead ends: 227 [2023-12-15 21:32:35,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2023-12-15 21:32:35,640 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 200 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:35,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 524 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:32:35,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-12-15 21:32:35,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 221. [2023-12-15 21:32:35,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 181 states have (on average 1.281767955801105) internal successors, (232), 182 states have internal predecessors, (232), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-15 21:32:35,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 290 transitions. [2023-12-15 21:32:35,660 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 290 transitions. Word has length 152 [2023-12-15 21:32:35,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:35,660 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 290 transitions. [2023-12-15 21:32:35,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.9) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-15 21:32:35,661 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 290 transitions. [2023-12-15 21:32:35,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-15 21:32:35,662 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:35,662 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:35,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-15 21:32:35,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-15 21:32:35,871 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:35,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:35,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1827934942, now seen corresponding path program 1 times [2023-12-15 21:32:35,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:35,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056946999] [2023-12-15 21:32:35,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:35,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:35,900 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:32:35,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1445865754] [2023-12-15 21:32:35,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:35,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:32:35,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:32:35,902 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:32:35,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-15 21:32:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:36,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-15 21:32:36,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:32:36,325 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 41 treesize of output 23 [2023-12-15 21:32:36,332 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 204 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-15 21:32:36,332 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:32:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 9 proven. 45 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-12-15 21:32:36,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:36,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056946999] [2023-12-15 21:32:36,517 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:32:36,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445865754] [2023-12-15 21:32:36,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445865754] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:32:36,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:32:36,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-12-15 21:32:36,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080107515] [2023-12-15 21:32:36,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 21:32:36,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:32:36,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:36,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:32:36,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:32:36,520 INFO L87 Difference]: Start difference. First operand 221 states and 290 transitions. Second operand has 10 states, 8 states have (on average 9.0) internal successors, (72), 10 states have internal predecessors, (72), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) [2023-12-15 21:32:36,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:36,753 INFO L93 Difference]: Finished difference Result 459 states and 595 transitions. [2023-12-15 21:32:36,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:32:36,756 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.0) internal successors, (72), 10 states have internal predecessors, (72), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) Word has length 154 [2023-12-15 21:32:36,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:36,758 INFO L225 Difference]: With dead ends: 459 [2023-12-15 21:32:36,758 INFO L226 Difference]: Without dead ends: 239 [2023-12-15 21:32:36,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 297 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2023-12-15 21:32:36,764 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 150 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:36,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 492 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:32:36,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-12-15 21:32:36,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 229. [2023-12-15 21:32:36,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 187 states have (on average 1.2620320855614973) internal successors, (236), 188 states have internal predecessors, (236), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-15 21:32:36,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 294 transitions. [2023-12-15 21:32:36,794 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 294 transitions. Word has length 154 [2023-12-15 21:32:36,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:36,796 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 294 transitions. [2023-12-15 21:32:36,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.0) internal successors, (72), 10 states have internal predecessors, (72), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) [2023-12-15 21:32:36,796 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 294 transitions. [2023-12-15 21:32:36,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-15 21:32:36,797 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:36,797 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:36,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-15 21:32:37,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-15 21:32:37,004 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:37,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:37,004 INFO L85 PathProgramCache]: Analyzing trace with hash 22496608, now seen corresponding path program 1 times [2023-12-15 21:32:37,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:37,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258283915] [2023-12-15 21:32:37,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:37,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:37,036 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:32:37,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [454903465] [2023-12-15 21:32:37,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:37,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:32:37,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:32:37,038 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:32:37,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-15 21:32:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:37,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 21:32:37,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:32:37,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:32:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-15 21:32:37,374 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:32:37,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:37,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258283915] [2023-12-15 21:32:37,375 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:32:37,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454903465] [2023-12-15 21:32:37,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454903465] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:37,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:37,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:32:37,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109471124] [2023-12-15 21:32:37,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:37,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:32:37,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:37,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:32:37,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:32:37,377 INFO L87 Difference]: Start difference. First operand 229 states and 294 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-15 21:32:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:37,457 INFO L93 Difference]: Finished difference Result 457 states and 587 transitions. [2023-12-15 21:32:37,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:32:37,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2023-12-15 21:32:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:37,461 INFO L225 Difference]: With dead ends: 457 [2023-12-15 21:32:37,461 INFO L226 Difference]: Without dead ends: 229 [2023-12-15 21:32:37,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:32:37,463 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 140 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:37,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 384 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:32:37,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-12-15 21:32:37,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2023-12-15 21:32:37,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 187 states have (on average 1.2513368983957218) internal successors, (234), 188 states have internal predecessors, (234), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-15 21:32:37,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 292 transitions. [2023-12-15 21:32:37,488 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 292 transitions. Word has length 154 [2023-12-15 21:32:37,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:37,488 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 292 transitions. [2023-12-15 21:32:37,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-15 21:32:37,489 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 292 transitions. [2023-12-15 21:32:37,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-15 21:32:37,490 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:37,490 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:37,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-15 21:32:37,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-15 21:32:37,698 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:37,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:37,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1344667067, now seen corresponding path program 1 times [2023-12-15 21:32:37,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:37,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358500936] [2023-12-15 21:32:37,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:37,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:37,728 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:32:37,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1925940194] [2023-12-15 21:32:37,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:37,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:32:37,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:32:37,730 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:32:37,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-15 21:32:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:32:38,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 21:32:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:32:38,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 21:32:38,439 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 21:32:38,440 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:32:38,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-15 21:32:38,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-15 21:32:38,651 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:38,654 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:32:38,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:32:38 BoogieIcfgContainer [2023-12-15 21:32:38,756 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:32:38,757 INFO L158 Benchmark]: Toolchain (without parser) took 32661.90ms. Allocated memory was 297.8MB in the beginning and 648.0MB in the end (delta: 350.2MB). Free memory was 248.5MB in the beginning and 359.2MB in the end (delta: -110.6MB). Peak memory consumption was 240.7MB. Max. memory is 8.0GB. [2023-12-15 21:32:38,757 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 186.6MB. Free memory was 140.1MB in the beginning and 140.0MB in the end (delta: 150.5kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:32:38,757 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.14ms. Allocated memory is still 297.8MB. Free memory was 248.5MB in the beginning and 233.5MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-15 21:32:38,757 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.60ms. Allocated memory is still 297.8MB. Free memory was 233.5MB in the beginning and 229.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 21:32:38,757 INFO L158 Benchmark]: Boogie Preprocessor took 93.96ms. Allocated memory is still 297.8MB. Free memory was 229.3MB in the beginning and 224.4MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-15 21:32:38,757 INFO L158 Benchmark]: RCFGBuilder took 645.31ms. Allocated memory is still 297.8MB. Free memory was 224.1MB in the beginning and 253.1MB in the end (delta: -29.0MB). Peak memory consumption was 28.1MB. Max. memory is 8.0GB. [2023-12-15 21:32:38,758 INFO L158 Benchmark]: TraceAbstraction took 31534.59ms. Allocated memory was 297.8MB in the beginning and 648.0MB in the end (delta: 350.2MB). Free memory was 252.0MB in the beginning and 359.2MB in the end (delta: -107.2MB). Peak memory consumption was 243.0MB. Max. memory is 8.0GB. [2023-12-15 21:32:38,759 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.13ms. Allocated memory is still 186.6MB. Free memory was 140.1MB in the beginning and 140.0MB in the end (delta: 150.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 297.14ms. Allocated memory is still 297.8MB. Free memory was 248.5MB in the beginning and 233.5MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 85.60ms. Allocated memory is still 297.8MB. Free memory was 233.5MB in the beginning and 229.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 93.96ms. Allocated memory is still 297.8MB. Free memory was 229.3MB in the beginning and 224.4MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 645.31ms. Allocated memory is still 297.8MB. Free memory was 224.1MB in the beginning and 253.1MB in the end (delta: -29.0MB). Peak memory consumption was 28.1MB. Max. memory is 8.0GB. * TraceAbstraction took 31534.59ms. Allocated memory was 297.8MB in the beginning and 648.0MB in the end (delta: 350.2MB). Free memory was 252.0MB in the beginning and 359.2MB in the end (delta: -107.2MB). Peak memory consumption was 243.0MB. 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 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L25-L27] double double_Array_0[3] = { 15.5, 16.65, 1000000.625 }; [L25-L27] double double_Array_0[3] = { 15.5, 16.65, 1000000.625 }; [L25-L27] double double_Array_0[3] = { 15.5, 16.65, 1000000.625 }; [L25-L27] double double_Array_0[3] = { 15.5, 16.65, 1000000.625 }; [L28-L30] float float_Array_0[1] = { 2.4 }; [L28-L30] float float_Array_0[1] = { 2.4 }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L34-L36] signed short int signed_short_int_Array_0[1] = { 500 }; [L34-L36] signed short int signed_short_int_Array_0[1] = { 500 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 8, 100 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 8, 100 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 8, 100 }; [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] FCALL updateLastVariables() [L104] CALL updateVariables() [L63] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L64] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L65] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L66] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L67] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] double_Array_0[0] = __VERIFIER_nondet_double() [L70] EXPR double_Array_0[0] [L70] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L70] EXPR double_Array_0[0] [L70] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && 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}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && 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}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && 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}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && 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}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] double_Array_0[1] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[1] [L72] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L72] EXPR double_Array_0[1] [L72] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L74] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not(signed_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] signed_char_Array_0[1][1] = __VERIFIER_nondet_char() [L83] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[1][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[1][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] signed_char_Array_0[0][2] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] EXPR signed_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L89] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L104] RET updateVariables() [L105] CALL step() [L43] EXPR signed_char_Array_0[0][2] [L43] EXPR signed_char_Array_0[1][1] [L43] EXPR signed_char_Array_0[0][1] [L43] EXPR signed_char_Array_0[1][0] [L43] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L43] EXPR ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0])) [L43] EXPR signed_char_Array_0[0][1] [L43] EXPR ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L43] signed_char_Array_0[1][2] = ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))) [L44] EXPR signed_char_Array_0[1][0] [L44] EXPR signed_char_Array_0[0][0] [L44] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L44] EXPR signed_char_Array_0[0][0] & signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L44] signed long int stepLocal_0 = (~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1]); [L45] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L45] COND FALSE !(stepLocal_0 >= signed_char_Array_0[0][1]) [L48] EXPR double_Array_0[0] [L48] double_Array_0[2] = double_Array_0[0] [L50] EXPR signed_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L50] EXPR ((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]) [L50] EXPR signed_char_Array_0[0][2] [L50] EXPR ((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, stepLocal_0=0, unsigned_short_int_Array_0={9:0}] [L50] signed_short_int_Array_0[0] = ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]))) [L51] EXPR signed_char_Array_0[0][0] [L51] EXPR unsigned_short_int_Array_0[1] [L51] signed long int stepLocal_1 = signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]; [L52] COND FALSE !(stepLocal_1 < -100) [L55] EXPR BOOL_unsigned_char_Array_0[2] [L55] EXPR BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, stepLocal_0=0, stepLocal_1=0, unsigned_short_int_Array_0={9:0}] [L55] EXPR BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L55] BOOL_unsigned_char_Array_0[0] = (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]) [L57] EXPR double_Array_0[1] [L57] float_Array_0[0] = double_Array_0[1] [L58] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] COND TRUE ! BOOL_unsigned_char_Array_0[0] [L59] EXPR signed_char_Array_0[1][0] [L59] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L59] EXPR ((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1) [L59] EXPR signed_char_Array_0[0][0] [L59] EXPR ((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, stepLocal_0=0, stepLocal_1=0, unsigned_short_int_Array_0={9:0}] [L59] unsigned_short_int_Array_0[0] = (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)) [L105] RET step() [L106] CALL, EXPR property() [L96] EXPR signed_char_Array_0[1][2] [L96] EXPR signed_char_Array_0[0][2] [L96] EXPR signed_char_Array_0[1][1] [L96] EXPR signed_char_Array_0[0][1] [L96] EXPR signed_char_Array_0[1][0] [L96] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0])) [L96] EXPR signed_char_Array_0[0][1] [L96] EXPR ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0]))) [L96] EXPR signed_char_Array_0[1][0] [L96] EXPR signed_char_Array_0[0][0] [L96] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR signed_char_Array_0[0][0] & signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])) [L96] EXPR double_Array_0[2] [L96] EXPR double_Array_0[0] [L96] EXPR (((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR ((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR ((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR ((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR ((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96-L97] return (((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1])) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.4s, OverallIterations: 13, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3971 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3917 mSDsluCounter, 7318 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5676 mSDsCounter, 378 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4488 IncrementalHoareTripleChecker+Invalid, 4866 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 378 mSolverCounterUnsat, 1642 mSDtfsCounter, 4488 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2524 GetRequests, 2322 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1476 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229occurred in iteration=11, InterpolantAutomatonStates: 163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 224 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 18.1s InterpolantComputationTime, 2104 NumberOfCodeBlocks, 2104 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2390 ConstructedInterpolants, 4 QuantifiedInterpolants, 17953 SizeOfPredicates, 94 NumberOfNonLiveVariables, 6530 ConjunctsInSsa, 209 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 10539/10944 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-15 21:32:38,810 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...