./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-46.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 74fee8aa4e06466e649a6b07a82fae07f22df3e533830cec1fb57a71456665c1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:20:30,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:20:30,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:20:30,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:20:30,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:20:30,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:20:30,121 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:20:30,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:20:30,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:20:30,122 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:20:30,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:20:30,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:20:30,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:20:30,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:20:30,123 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:20:30,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:20:30,124 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:20:30,124 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:20:30,124 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:20:30,125 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:20:30,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:20:30,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:20:30,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:20:30,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:20:30,128 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:20:30,129 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:20:30,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:20:30,129 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:20:30,129 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:20:30,130 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:20:30,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:20:30,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:20:30,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:20:30,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:20:30,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:20:30,131 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:20:30,131 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:20:30,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:20:30,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:20:30,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:20:30,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:20:30,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:20:30,136 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 74fee8aa4e06466e649a6b07a82fae07f22df3e533830cec1fb57a71456665c1 [2024-11-12 07:20:30,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:20:30,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:20:30,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:20:30,381 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:20:30,381 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:20:30,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-46.i [2024-11-12 07:20:31,820 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:20:32,007 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:20:32,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-46.i [2024-11-12 07:20:32,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02a42225e/f52e0afe56a340398bee3ffdf3d995de/FLAG61778ee7b [2024-11-12 07:20:32,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02a42225e/f52e0afe56a340398bee3ffdf3d995de [2024-11-12 07:20:32,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:20:32,031 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:20:32,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:20:32,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:20:32,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:20:32,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:20:32" (1/1) ... [2024-11-12 07:20:32,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16a183df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:32, skipping insertion in model container [2024-11-12 07:20:32,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:20:32" (1/1) ... [2024-11-12 07:20:32,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:20:32,215 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-46.i[917,930] [2024-11-12 07:20:32,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:20:32,274 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:20:32,284 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-46.i[917,930] [2024-11-12 07:20:32,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:20:32,375 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:20:32,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:32 WrapperNode [2024-11-12 07:20:32,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:20:32,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:20:32,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:20:32,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:20:32,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:32" (1/1) ... [2024-11-12 07:20:32,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:32" (1/1) ... [2024-11-12 07:20:32,441 INFO L138 Inliner]: procedures = 29, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 413 [2024-11-12 07:20:32,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:20:32,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:20:32,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:20:32,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:20:32,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:32" (1/1) ... [2024-11-12 07:20:32,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:32" (1/1) ... [2024-11-12 07:20:32,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:32" (1/1) ... [2024-11-12 07:20:32,486 INFO L175 MemorySlicer]: Split 101 memory accesses to 5 slices as follows [2, 37, 8, 40, 14]. 40 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 3, 2]. The 16 writes are split as follows [0, 9, 1, 3, 3]. [2024-11-12 07:20:32,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:32" (1/1) ... [2024-11-12 07:20:32,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:32" (1/1) ... [2024-11-12 07:20:32,506 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:32" (1/1) ... [2024-11-12 07:20:32,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:32" (1/1) ... [2024-11-12 07:20:32,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:32" (1/1) ... [2024-11-12 07:20:32,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:32" (1/1) ... [2024-11-12 07:20:32,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:20:32,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:20:32,527 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:20:32,527 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:20:32,527 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:32" (1/1) ... [2024-11-12 07:20:32,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:20:32,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:20:32,563 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) [2024-11-12 07:20:32,567 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 [2024-11-12 07:20:32,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:20:32,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-12 07:20:32,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-12 07:20:32,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-12 07:20:32,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-12 07:20:32,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-12 07:20:32,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 07:20:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 07:20:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 07:20:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 07:20:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-12 07:20:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-12 07:20:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-12 07:20:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-12 07:20:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-12 07:20:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-12 07:20:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 07:20:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 07:20:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 07:20:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 07:20:32,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-12 07:20:32,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-12 07:20:32,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-12 07:20:32,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-12 07:20:32,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-12 07:20:32,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-12 07:20:32,607 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:20:32,607 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:20:32,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 07:20:32,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 07:20:32,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 07:20:32,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 07:20:32,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-12 07:20:32,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:20:32,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:20:32,737 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:20:32,739 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:20:33,098 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-11-12 07:20:33,098 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:20:33,113 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:20:33,114 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:20:33,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:20:33 BoogieIcfgContainer [2024-11-12 07:20:33,114 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:20:33,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:20:33,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:20:33,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:20:33,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:20:32" (1/3) ... [2024-11-12 07:20:33,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36148e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:20:33, skipping insertion in model container [2024-11-12 07:20:33,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:32" (2/3) ... [2024-11-12 07:20:33,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36148e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:20:33, skipping insertion in model container [2024-11-12 07:20:33,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:20:33" (3/3) ... [2024-11-12 07:20:33,124 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-46.i [2024-11-12 07:20:33,139 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:20:33,140 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:20:33,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:20:33,195 INFO L333 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, 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;@4990b916, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:20:33,196 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:20:33,200 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 07:20:33,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 07:20:33,209 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:20:33,210 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:20:33,210 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:20:33,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:20:33,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1009715545, now seen corresponding path program 1 times [2024-11-12 07:20:33,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:20:33,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483180942] [2024-11-12 07:20:33,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:20:33,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:20:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:33,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:20:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:33,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:20:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:33,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:20:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:33,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:20:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:33,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:20:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:33,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:20:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:33,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:20:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:33,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:20:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:33,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:20:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:33,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:20:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:33,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:20:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:33,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:20:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:33,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:20:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:33,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:20:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:33,500 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 07:20:33,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:20:33,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483180942] [2024-11-12 07:20:33,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483180942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:20:33,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:20:33,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:20:33,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020684353] [2024-11-12 07:20:33,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:20:33,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:20:33,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:20:33,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:20:33,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:20:33,529 INFO L87 Difference]: Start difference. First operand has 101 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-12 07:20:33,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:20:33,561 INFO L93 Difference]: Finished difference Result 195 states and 302 transitions. [2024-11-12 07:20:33,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:20:33,564 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-11-12 07:20:33,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:20:33,570 INFO L225 Difference]: With dead ends: 195 [2024-11-12 07:20:33,571 INFO L226 Difference]: Without dead ends: 97 [2024-11-12 07:20:33,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:20:33,578 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:20:33,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:20:33,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-12 07:20:33,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-12 07:20:33,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.382716049382716) internal successors, (112), 81 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 07:20:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2024-11-12 07:20:33,695 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 116 [2024-11-12 07:20:33,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:20:33,695 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2024-11-12 07:20:33,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-12 07:20:33,696 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2024-11-12 07:20:33,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 07:20:33,701 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:20:33,701 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:20:33,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:20:33,701 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:20:33,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:20:33,705 INFO L85 PathProgramCache]: Analyzing trace with hash -675339485, now seen corresponding path program 1 times [2024-11-12 07:20:33,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:20:33,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296820514] [2024-11-12 07:20:33,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:20:33,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:20:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:20:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:20:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:20:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:20:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:20:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:20:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:20:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:20:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:20:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:20:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:20:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:20:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:20:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:20:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 07:20:34,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:20:34,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296820514] [2024-11-12 07:20:34,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296820514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:20:34,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:20:34,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:20:34,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357540814] [2024-11-12 07:20:34,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:20:34,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:20:34,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:20:34,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:20:34,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:20:34,363 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:20:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:20:34,537 INFO L93 Difference]: Finished difference Result 255 states and 367 transitions. [2024-11-12 07:20:34,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:20:34,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-12 07:20:34,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:20:34,540 INFO L225 Difference]: With dead ends: 255 [2024-11-12 07:20:34,540 INFO L226 Difference]: Without dead ends: 161 [2024-11-12 07:20:34,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:20:34,541 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 89 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:20:34,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 747 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:20:34,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-12 07:20:34,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2024-11-12 07:20:34,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 134 states have (on average 1.3805970149253732) internal successors, (185), 135 states have internal predecessors, (185), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-12 07:20:34,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 227 transitions. [2024-11-12 07:20:34,554 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 227 transitions. Word has length 116 [2024-11-12 07:20:34,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:20:34,554 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 227 transitions. [2024-11-12 07:20:34,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:20:34,555 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 227 transitions. [2024-11-12 07:20:34,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 07:20:34,556 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:20:34,556 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:20:34,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:20:34,556 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:20:34,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:20:34,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1262145499, now seen corresponding path program 1 times [2024-11-12 07:20:34,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:20:34,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859374609] [2024-11-12 07:20:34,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:20:34,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:20:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:20:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:20:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:20:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:20:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:20:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:20:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:20:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:20:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:20:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:20:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:20:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:20:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:20:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:20:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:34,985 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 07:20:34,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:20:34,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859374609] [2024-11-12 07:20:34,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859374609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:20:34,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:20:34,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:20:34,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775832129] [2024-11-12 07:20:34,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:20:34,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:20:34,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:20:34,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:20:34,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:20:34,989 INFO L87 Difference]: Start difference. First operand 158 states and 227 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:20:35,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:20:35,104 INFO L93 Difference]: Finished difference Result 401 states and 577 transitions. [2024-11-12 07:20:35,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:20:35,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-12 07:20:35,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:20:35,108 INFO L225 Difference]: With dead ends: 401 [2024-11-12 07:20:35,110 INFO L226 Difference]: Without dead ends: 246 [2024-11-12 07:20:35,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:20:35,113 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 59 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:20:35,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 562 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:20:35,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-12 07:20:35,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 178. [2024-11-12 07:20:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 154 states have (on average 1.3766233766233766) internal successors, (212), 155 states have internal predecessors, (212), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-12 07:20:35,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 254 transitions. [2024-11-12 07:20:35,135 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 254 transitions. Word has length 116 [2024-11-12 07:20:35,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:20:35,136 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 254 transitions. [2024-11-12 07:20:35,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:20:35,136 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 254 transitions. [2024-11-12 07:20:35,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 07:20:35,139 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:20:35,139 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:20:35,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:20:35,140 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:20:35,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:20:35,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1955203163, now seen corresponding path program 1 times [2024-11-12 07:20:35,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:20:35,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705427945] [2024-11-12 07:20:35,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:20:35,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:20:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:35,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:20:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:35,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:20:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:35,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:20:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:35,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:20:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:35,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:20:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:35,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:20:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:35,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:20:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:35,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:20:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:35,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:20:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:35,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:20:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:35,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:20:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:35,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:20:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:35,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:20:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:35,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:20:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:35,622 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 07:20:35,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:20:35,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705427945] [2024-11-12 07:20:35,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705427945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:20:35,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:20:35,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:20:35,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905086927] [2024-11-12 07:20:35,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:20:35,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:20:35,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:20:35,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:20:35,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:20:35,624 INFO L87 Difference]: Start difference. First operand 178 states and 254 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:20:35,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:20:35,769 INFO L93 Difference]: Finished difference Result 425 states and 608 transitions. [2024-11-12 07:20:35,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:20:35,770 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-12 07:20:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:20:35,771 INFO L225 Difference]: With dead ends: 425 [2024-11-12 07:20:35,771 INFO L226 Difference]: Without dead ends: 250 [2024-11-12 07:20:35,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:20:35,774 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 218 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:20:35,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 519 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:20:35,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-12 07:20:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 178. [2024-11-12 07:20:35,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 154 states have (on average 1.3766233766233766) internal successors, (212), 155 states have internal predecessors, (212), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-12 07:20:35,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 254 transitions. [2024-11-12 07:20:35,794 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 254 transitions. Word has length 116 [2024-11-12 07:20:35,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:20:35,794 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 254 transitions. [2024-11-12 07:20:35,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:20:35,795 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 254 transitions. [2024-11-12 07:20:35,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-12 07:20:35,796 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:20:35,797 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:20:35,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:20:35,797 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:20:35,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:20:35,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1079912016, now seen corresponding path program 1 times [2024-11-12 07:20:35,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:20:35,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105429943] [2024-11-12 07:20:35,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:20:35,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:20:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 07:20:35,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2121434720] [2024-11-12 07:20:35,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:20:35,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:20:35,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:20:35,902 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) [2024-11-12 07:20:35,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 07:20:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:36,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 07:20:36,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:20:36,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-12 07:20:36,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-12 07:20:37,073 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-12 07:20:37,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:20:37,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:20:37,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105429943] [2024-11-12 07:20:37,718 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 07:20:37,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121434720] [2024-11-12 07:20:37,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121434720] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:20:37,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:20:37,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-12 07:20:37,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54667562] [2024-11-12 07:20:37,720 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 07:20:37,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:20:37,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:20:37,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:20:37,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=110, Unknown=4, NotChecked=0, Total=156 [2024-11-12 07:20:37,721 INFO L87 Difference]: Start difference. First operand 178 states and 254 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-12 07:20:38,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:20:38,324 INFO L93 Difference]: Finished difference Result 683 states and 976 transitions. [2024-11-12 07:20:38,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:20:38,325 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2024-11-12 07:20:38,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:20:38,328 INFO L225 Difference]: With dead ends: 683 [2024-11-12 07:20:38,328 INFO L226 Difference]: Without dead ends: 508 [2024-11-12 07:20:38,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=186, Unknown=4, NotChecked=0, Total=272 [2024-11-12 07:20:38,329 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 288 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 15 mSolverCounterUnsat, 49 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 49 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:20:38,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 687 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 293 Invalid, 49 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:20:38,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-12 07:20:38,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 377. [2024-11-12 07:20:38,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 330 states have (on average 1.3909090909090909) internal successors, (459), 332 states have internal predecessors, (459), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-12 07:20:38,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 543 transitions. [2024-11-12 07:20:38,349 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 543 transitions. Word has length 118 [2024-11-12 07:20:38,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:20:38,349 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 543 transitions. [2024-11-12 07:20:38,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-12 07:20:38,349 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 543 transitions. [2024-11-12 07:20:38,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-12 07:20:38,350 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:20:38,351 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:20:38,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 07:20:38,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:20:38,552 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:20:38,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:20:38,553 INFO L85 PathProgramCache]: Analyzing trace with hash 93460718, now seen corresponding path program 1 times [2024-11-12 07:20:38,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:20:38,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280944826] [2024-11-12 07:20:38,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:20:38,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:20:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 07:20:38,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1407532457] [2024-11-12 07:20:38,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:20:38,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:20:38,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:20:38,670 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) [2024-11-12 07:20:38,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 07:20:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:20:39,115 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:20:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:20:39,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:20:39,340 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:20:39,341 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:20:39,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 07:20:39,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-12 07:20:39,547 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-12 07:20:39,650 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:20:39,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:20:39 BoogieIcfgContainer [2024-11-12 07:20:39,652 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:20:39,653 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:20:39,653 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:20:39,653 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:20:39,653 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:20:33" (3/4) ... [2024-11-12 07:20:39,655 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:20:39,656 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:20:39,657 INFO L158 Benchmark]: Toolchain (without parser) took 7625.33ms. Allocated memory was 167.8MB in the beginning and 325.1MB in the end (delta: 157.3MB). Free memory was 93.4MB in the beginning and 122.7MB in the end (delta: -29.3MB). Peak memory consumption was 128.8MB. Max. memory is 16.1GB. [2024-11-12 07:20:39,657 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 119.5MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:20:39,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.07ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 136.8MB in the end (delta: -43.6MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-11-12 07:20:39,657 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.57ms. Allocated memory is still 167.8MB. Free memory was 136.8MB in the beginning and 133.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 07:20:39,657 INFO L158 Benchmark]: Boogie Preprocessor took 77.70ms. Allocated memory is still 167.8MB. Free memory was 133.7MB in the beginning and 129.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:20:39,658 INFO L158 Benchmark]: RCFGBuilder took 590.33ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 94.9MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-12 07:20:39,658 INFO L158 Benchmark]: TraceAbstraction took 6536.49ms. Allocated memory was 167.8MB in the beginning and 325.1MB in the end (delta: 157.3MB). Free memory was 93.9MB in the beginning and 122.7MB in the end (delta: -28.8MB). Peak memory consumption was 128.4MB. Max. memory is 16.1GB. [2024-11-12 07:20:39,658 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 325.1MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:20:39,659 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.16ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 119.5MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.07ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 136.8MB in the end (delta: -43.6MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.57ms. Allocated memory is still 167.8MB. Free memory was 136.8MB in the beginning and 133.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.70ms. Allocated memory is still 167.8MB. Free memory was 133.7MB in the beginning and 129.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 590.33ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 94.9MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6536.49ms. Allocated memory was 167.8MB in the beginning and 325.1MB in the end (delta: 157.3MB). Free memory was 93.9MB in the beginning and 122.7MB in the end (delta: -28.8MB). Peak memory consumption was 128.4MB. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 325.1MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. * 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 112. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1]); [L27] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer = &(BOOL_unsigned_char_Array_0[2]); [L28] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer = &(BOOL_unsigned_char_Array_0[3]); [L29] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer = &(BOOL_unsigned_char_Array_0[4]); [L30-L32] double double_Array_0[1] = { 31.75 }; [L30-L32] double double_Array_0[1] = { 31.75 }; [L33] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0]); [L34-L36] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L34-L36] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L34-L36] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L34-L36] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L37] signed char* signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer = &(signed_char_Array_0[0]); [L38] signed char* signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer = &(signed_char_Array_0[1]); [L39] signed char* signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer = &(signed_char_Array_0[2]); [L40-L42] signed short int signed_short_int_Array_0[2] = { 32, -4 }; [L40-L42] signed short int signed_short_int_Array_0[2] = { 32, -4 }; [L40-L42] signed short int signed_short_int_Array_0[2] = { 32, -4 }; [L43] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L44] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer = &(signed_short_int_Array_0[1]); [L45] unsigned char last_1_BOOL_unsigned_char_Array_0_4_ = 1; [L46] signed short int last_1_signed_short_int_Array_0_1_ = -4; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L108] EXPR BOOL_unsigned_char_Array_0[4] [L108] last_1_BOOL_unsigned_char_Array_0_4_ = BOOL_unsigned_char_Array_0[4] [L109] EXPR signed_short_int_Array_0[1] [L109] last_1_signed_short_int_Array_0_1_ = signed_short_int_Array_0[1] [L119] RET updateLastVariables() [L120] CALL updateVariables() [L85] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L86] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L86] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L86] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L87] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L87] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L87] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L88] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L89] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L89] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L89] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L90] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L90] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L90] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L91] BOOL_unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L92] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L92] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L92] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L93] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L93] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L93] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L94] double_Array_0[0] = __VERIFIER_nondet_double() [L95] EXPR double_Array_0[0] [L95] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L95] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L95] EXPR double_Array_0[0] [L95] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L95] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L95] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L95] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L95] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L96] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L97] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L97] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L97] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L98] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L98] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L98] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L99] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L100] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L100] CALL assume_abort_if_not(signed_char_Array_0[2] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L100] RET assume_abort_if_not(signed_char_Array_0[2] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L101] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L101] CALL assume_abort_if_not(signed_char_Array_0[2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L101] RET assume_abort_if_not(signed_char_Array_0[2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L102] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L102] CALL assume_abort_if_not(signed_char_Array_0[2] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L102] RET assume_abort_if_not(signed_char_Array_0[2] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L103] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L104] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L104] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L104] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L105] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L105] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L105] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L120] RET updateVariables() [L121] CALL step() [L50] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L50] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L50] COND FALSE !(last_1_signed_short_int_Array_0_1_ <= ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) / (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) [L55] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) [L55] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L55] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) [L55] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) [L55] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L55] signed long int stepLocal_1 = ((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))); [L56] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L56] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) [L56] signed long int stepLocal_0 = (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) / (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)); [L57] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L57] COND TRUE (- (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) >= 16.75 [L58] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L58] COND TRUE stepLocal_0 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) [L59] COND TRUE stepLocal_1 > -32 [L60] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) = 0 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L74] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L74] signed char stepLocal_2 = (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)); [L75] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L75] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L75] EXPR (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) | (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, stepLocal_2=-25] [L75] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L75] COND TRUE (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) | (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < stepLocal_2 [L76] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L76] (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) = ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) - 256) [L80] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L80] COND FALSE !(1 == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L112] EXPR ((- (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) >= 16.75) ? ((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) / (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? (((((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) > -32) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 0)) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 1)) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 1)) [L112] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer) [L112] EXPR ((- (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) >= 16.75) ? ((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) / (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? (((((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) > -32) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 0)) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 1)) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L112] EXPR (((- (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) >= 16.75) ? ((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) / (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? (((((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) > -32) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 0)) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 1)) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 1))) && ((1 == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L112] EXPR (((- (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) >= 16.75) ? ((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) / (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? (((((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) > -32) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 0)) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 1)) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 1))) && ((1 == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L112] EXPR ((((- (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) >= 16.75) ? ((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) / (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? (((((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) > -32) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 0)) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 1)) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 1))) && ((1 == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)))) : 1)) && (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) | (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) - 256))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 128))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L112] EXPR ((((- (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) >= 16.75) ? ((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) / (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? (((((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) > -32) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 0)) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 1)) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 1))) && ((1 == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)))) : 1)) && (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) | (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) - 256))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 128))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L112] EXPR (((((- (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) >= 16.75) ? ((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) / (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? (((((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) > -32) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 0)) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 1)) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 1))) && ((1 == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)))) : 1)) && (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) | (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) - 256))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 128)))) && ((last_1_signed_short_int_Array_0_1_ <= ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) / (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? (last_1_BOOL_unsigned_char_Array_0_4_ ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L112] EXPR (((((- (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) >= 16.75) ? ((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) / (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? (((((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) > -32) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 0)) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 1)) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 1))) && ((1 == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)))) : 1)) && (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) | (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) - 256))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 128)))) && ((last_1_signed_short_int_Array_0_1_ <= ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) / (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? (last_1_BOOL_unsigned_char_Array_0_4_ ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L112-L113] return (((((- (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) >= 16.75) ? ((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) / (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? (((((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) > -32) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 0)) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 1)) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) == ((unsigned char) 1))) && ((1 == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)))) : 1)) && (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) | (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) + (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) < (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) - 256))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 128)))) && ((last_1_signed_short_int_Array_0_1_ <= ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) / (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? (last_1_BOOL_unsigned_char_Array_0_4_ ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : 1) : 1) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 49 mSolverCounterUnknown, 654 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 654 mSDsluCounter, 2655 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1944 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 708 IncrementalHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 711 mSDtfsCounter, 708 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=377occurred in iteration=5, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 274 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 936 NumberOfCodeBlocks, 936 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 577 ConstructedInterpolants, 2 QuantifiedInterpolants, 2707 SizeOfPredicates, 4 NumberOfNonLiveVariables, 439 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 1640/1820 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 [2024-11-12 07:20:39,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-46.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 74fee8aa4e06466e649a6b07a82fae07f22df3e533830cec1fb57a71456665c1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:20:42,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:20:42,129 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:20:42,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:20:42,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:20:42,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:20:42,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:20:42,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:20:42,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:20:42,171 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:20:42,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:20:42,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:20:42,172 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:20:42,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:20:42,173 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:20:42,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:20:42,176 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:20:42,178 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:20:42,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:20:42,179 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:20:42,179 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:20:42,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:20:42,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:20:42,182 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:20:42,182 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:20:42,183 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:20:42,183 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:20:42,183 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:20:42,184 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:20:42,184 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:20:42,184 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:20:42,184 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:20:42,185 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:20:42,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:20:42,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:20:42,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:20:42,187 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:20:42,187 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:20:42,187 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:20:42,187 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:20:42,188 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:20:42,188 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:20:42,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:20:42,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:20:42,190 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 74fee8aa4e06466e649a6b07a82fae07f22df3e533830cec1fb57a71456665c1 [2024-11-12 07:20:42,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:20:42,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:20:42,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:20:42,563 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:20:42,564 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:20:42,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-46.i [2024-11-12 07:20:44,490 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:20:44,703 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:20:44,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-46.i [2024-11-12 07:20:44,712 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b884925/2e3c384e22c14890b3574a596f490bf2/FLAG5abcb7702 [2024-11-12 07:20:45,062 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b884925/2e3c384e22c14890b3574a596f490bf2 [2024-11-12 07:20:45,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:20:45,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:20:45,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:20:45,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:20:45,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:20:45,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:20:45" (1/1) ... [2024-11-12 07:20:45,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@218b3b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:45, skipping insertion in model container [2024-11-12 07:20:45,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:20:45" (1/1) ... [2024-11-12 07:20:45,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:20:45,397 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-46.i[917,930] [2024-11-12 07:20:45,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:20:45,532 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:20:45,544 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-46.i[917,930] [2024-11-12 07:20:45,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:20:45,587 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:20:45,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:45 WrapperNode [2024-11-12 07:20:45,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:20:45,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:20:45,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:20:45,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:20:45,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:45" (1/1) ... [2024-11-12 07:20:45,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:45" (1/1) ... [2024-11-12 07:20:45,652 INFO L138 Inliner]: procedures = 33, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 392 [2024-11-12 07:20:45,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:20:45,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:20:45,657 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:20:45,657 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:20:45,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:45" (1/1) ... [2024-11-12 07:20:45,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:45" (1/1) ... [2024-11-12 07:20:45,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:45" (1/1) ... [2024-11-12 07:20:45,697 INFO L175 MemorySlicer]: Split 101 memory accesses to 5 slices as follows [2, 37, 8, 40, 14]. 40 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 3, 2]. The 16 writes are split as follows [0, 9, 1, 3, 3]. [2024-11-12 07:20:45,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:45" (1/1) ... [2024-11-12 07:20:45,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:45" (1/1) ... [2024-11-12 07:20:45,708 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:45" (1/1) ... [2024-11-12 07:20:45,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:45" (1/1) ... [2024-11-12 07:20:45,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:45" (1/1) ... [2024-11-12 07:20:45,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:45" (1/1) ... [2024-11-12 07:20:45,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:20:45,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:20:45,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:20:45,722 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:20:45,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:45" (1/1) ... [2024-11-12 07:20:45,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:20:45,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:20:45,761 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) [2024-11-12 07:20:45,767 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 [2024-11-12 07:20:45,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:20:45,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-12 07:20:45,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-12 07:20:45,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-12 07:20:45,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-12 07:20:45,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-12 07:20:45,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-12 07:20:45,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-12 07:20:45,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-12 07:20:45,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-12 07:20:45,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-12 07:20:45,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 07:20:45,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 07:20:45,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-12 07:20:45,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-12 07:20:45,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-12 07:20:45,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-12 07:20:45,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-12 07:20:45,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-12 07:20:45,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-12 07:20:45,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-12 07:20:45,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:20:45,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 07:20:45,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-12 07:20:45,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-12 07:20:45,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-12 07:20:45,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-12 07:20:45,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-12 07:20:45,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-12 07:20:45,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-12 07:20:45,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-12 07:20:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-12 07:20:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-12 07:20:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-12 07:20:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-12 07:20:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-12 07:20:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:20:45,823 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:20:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:20:45,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:20:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 07:20:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 07:20:45,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-12 07:20:45,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-12 07:20:45,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-12 07:20:45,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-12 07:20:45,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-12 07:20:45,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-12 07:20:45,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-12 07:20:45,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-12 07:20:46,001 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:20:46,003 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:20:46,484 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-11-12 07:20:46,484 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:20:46,496 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:20:46,496 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:20:46,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:20:46 BoogieIcfgContainer [2024-11-12 07:20:46,496 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:20:46,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:20:46,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:20:46,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:20:46,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:20:45" (1/3) ... [2024-11-12 07:20:46,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c54ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:20:46, skipping insertion in model container [2024-11-12 07:20:46,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:20:45" (2/3) ... [2024-11-12 07:20:46,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c54ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:20:46, skipping insertion in model container [2024-11-12 07:20:46,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:20:46" (3/3) ... [2024-11-12 07:20:46,502 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-46.i [2024-11-12 07:20:46,515 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:20:46,515 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:20:46,570 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:20:46,575 INFO L333 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, 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;@ad51af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:20:46,576 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:20:46,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 77 states have internal predecessors, (107), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 07:20:46,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 07:20:46,588 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:20:46,588 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:20:46,589 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:20:46,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:20:46,593 INFO L85 PathProgramCache]: Analyzing trace with hash -421847647, now seen corresponding path program 1 times [2024-11-12 07:20:46,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:20:46,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218715396] [2024-11-12 07:20:46,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:20:46,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:20:46,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:20:46,623 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:20:46,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 07:20:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:46,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:20:46,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:20:46,988 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-11-12 07:20:46,988 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:20:46,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:20:46,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218715396] [2024-11-12 07:20:46,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218715396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:20:46,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:20:46,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:20:46,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332836018] [2024-11-12 07:20:46,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:20:46,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:20:46,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:20:47,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:20:47,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:20:47,013 INFO L87 Difference]: Start difference. First operand has 93 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 77 states have internal predecessors, (107), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-12 07:20:47,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:20:47,034 INFO L93 Difference]: Finished difference Result 179 states and 278 transitions. [2024-11-12 07:20:47,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:20:47,036 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-11-12 07:20:47,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:20:47,043 INFO L225 Difference]: With dead ends: 179 [2024-11-12 07:20:47,043 INFO L226 Difference]: Without dead ends: 89 [2024-11-12 07:20:47,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:20:47,049 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:20:47,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:20:47,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-12 07:20:47,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-12 07:20:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 07:20:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2024-11-12 07:20:47,094 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 114 [2024-11-12 07:20:47,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:20:47,094 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2024-11-12 07:20:47,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-12 07:20:47,096 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2024-11-12 07:20:47,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 07:20:47,102 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:20:47,102 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:20:47,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 07:20:47,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:20:47,308 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:20:47,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:20:47,309 INFO L85 PathProgramCache]: Analyzing trace with hash 807549213, now seen corresponding path program 1 times [2024-11-12 07:20:47,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:20:47,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539589081] [2024-11-12 07:20:47,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:20:47,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:20:47,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:20:47,314 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:20:47,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 07:20:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:47,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 07:20:47,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:20:47,847 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 21 treesize of output 9 [2024-11-12 07:20:49,548 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 18 treesize of output 10 [2024-11-12 07:20:50,636 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 26 treesize of output 18 [2024-11-12 07:20:51,513 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 143 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:20:51,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:20:53,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:20:53,143 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 23 treesize of output 26 [2024-11-12 07:20:53,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:20:53,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539589081] [2024-11-12 07:20:53,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539589081] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:20:53,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1793545804] [2024-11-12 07:20:53,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:20:53,536 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 07:20:53,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 07:20:53,538 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 07:20:53,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-12 07:20:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:54,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-12 07:20:54,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:20:55,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2024-11-12 07:20:56,568 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 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-12 07:20:57,496 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 26 treesize of output 18 [2024-11-12 07:20:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 99 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:20:58,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:20:59,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1793545804] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:20:59,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:20:59,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 24 [2024-11-12 07:20:59,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091922720] [2024-11-12 07:20:59,258 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:20:59,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-12 07:20:59,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:20:59,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-12 07:20:59,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2024-11-12 07:20:59,261 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 25 states, 22 states have (on average 4.045454545454546) internal successors, (89), 20 states have internal predecessors, (89), 7 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 5 states have call predecessors, (28), 7 states have call successors, (28) [2024-11-12 07:21:18,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:18,905 INFO L93 Difference]: Finished difference Result 460 states and 653 transitions. [2024-11-12 07:21:18,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-12 07:21:18,909 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 4.045454545454546) internal successors, (89), 20 states have internal predecessors, (89), 7 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 5 states have call predecessors, (28), 7 states have call successors, (28) Word has length 114 [2024-11-12 07:21:18,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:18,912 INFO L225 Difference]: With dead ends: 460 [2024-11-12 07:21:18,912 INFO L226 Difference]: Without dead ends: 374 [2024-11-12 07:21:18,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 259 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=844, Invalid=3188, Unknown=0, NotChecked=0, Total=4032 [2024-11-12 07:21:18,915 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 1395 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1395 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:18,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1395 Valid, 1635 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2024-11-12 07:21:18,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-12 07:21:18,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 208. [2024-11-12 07:21:18,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 166 states have (on average 1.3313253012048192) internal successors, (221), 167 states have internal predecessors, (221), 35 states have call successors, (35), 6 states have call predecessors, (35), 6 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-12 07:21:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 291 transitions. [2024-11-12 07:21:18,949 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 291 transitions. Word has length 114 [2024-11-12 07:21:18,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:18,949 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 291 transitions. [2024-11-12 07:21:18,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 4.045454545454546) internal successors, (89), 20 states have internal predecessors, (89), 7 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 5 states have call predecessors, (28), 7 states have call successors, (28) [2024-11-12 07:21:18,950 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 291 transitions. [2024-11-12 07:21:18,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 07:21:18,952 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:18,952 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:18,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-12 07:21:19,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 07:21:19,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:21:19,357 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:19,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:19,357 INFO L85 PathProgramCache]: Analyzing trace with hash 220743199, now seen corresponding path program 1 times [2024-11-12 07:21:19,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:21:19,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678550522] [2024-11-12 07:21:19,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:19,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:21:19,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:21:19,362 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:21:19,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 07:21:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:19,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 07:21:19,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:21:19,542 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 12 treesize of output 8 [2024-11-12 07:21:19,561 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 37 treesize of output 25 [2024-11-12 07:21:19,577 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 07:21:19,577 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:21:19,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:21:19,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678550522] [2024-11-12 07:21:19,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678550522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:19,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:19,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:21:19,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297829175] [2024-11-12 07:21:19,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:19,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:21:19,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:21:19,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:21:19,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:21:19,580 INFO L87 Difference]: Start difference. First operand 208 states and 291 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:21:19,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:19,723 INFO L93 Difference]: Finished difference Result 408 states and 577 transitions. [2024-11-12 07:21:19,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:21:19,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-11-12 07:21:19,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:19,727 INFO L225 Difference]: With dead ends: 408 [2024-11-12 07:21:19,727 INFO L226 Difference]: Without dead ends: 284 [2024-11-12 07:21:19,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:21:19,729 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 49 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:19,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 496 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:21:19,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-12 07:21:19,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 224. [2024-11-12 07:21:19,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 182 states have (on average 1.3296703296703296) internal successors, (242), 183 states have internal predecessors, (242), 35 states have call successors, (35), 6 states have call predecessors, (35), 6 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-12 07:21:19,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 312 transitions. [2024-11-12 07:21:19,777 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 312 transitions. Word has length 114 [2024-11-12 07:21:19,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:19,777 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 312 transitions. [2024-11-12 07:21:19,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:21:19,777 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 312 transitions. [2024-11-12 07:21:19,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-12 07:21:19,781 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:19,782 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:19,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-12 07:21:19,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:21:19,982 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:19,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:19,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1214006248, now seen corresponding path program 1 times [2024-11-12 07:21:19,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:21:19,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104891142] [2024-11-12 07:21:19,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:19,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:21:19,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:21:19,988 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:21:19,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 07:21:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:20,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:21:20,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:21:20,170 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 21 treesize of output 9 [2024-11-12 07:21:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 07:21:20,310 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:21:20,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:21:20,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104891142] [2024-11-12 07:21:20,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1104891142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:20,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:20,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:21:20,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651226099] [2024-11-12 07:21:20,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:20,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:21:20,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:21:20,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:21:20,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:21:20,313 INFO L87 Difference]: Start difference. First operand 224 states and 312 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:21:20,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:20,522 INFO L93 Difference]: Finished difference Result 523 states and 739 transitions. [2024-11-12 07:21:20,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:21:20,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2024-11-12 07:21:20,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:20,525 INFO L225 Difference]: With dead ends: 523 [2024-11-12 07:21:20,525 INFO L226 Difference]: Without dead ends: 399 [2024-11-12 07:21:20,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:21:20,527 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 187 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:20,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 342 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:21:20,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-12 07:21:20,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 388. [2024-11-12 07:21:20,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 323 states have (on average 1.3498452012383901) internal successors, (436), 325 states have internal predecessors, (436), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-12 07:21:20,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 548 transitions. [2024-11-12 07:21:20,554 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 548 transitions. Word has length 115 [2024-11-12 07:21:20,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:20,554 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 548 transitions. [2024-11-12 07:21:20,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:21:20,555 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 548 transitions. [2024-11-12 07:21:20,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-12 07:21:20,556 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:20,556 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:20,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-12 07:21:20,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:21:20,757 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:20,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:20,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1636708074, now seen corresponding path program 1 times [2024-11-12 07:21:20,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:21:20,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171270884] [2024-11-12 07:21:20,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:20,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:21:20,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:21:20,762 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:21:20,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 07:21:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:20,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-12 07:21:20,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:21:21,833 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 12 treesize of output 8 [2024-11-12 07:21:21,912 INFO L349 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2024-11-12 07:21:21,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 26 treesize of output 32 [2024-11-12 07:21:21,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:21:21,951 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 46 treesize of output 30 [2024-11-12 07:21:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 07:21:21,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:21:21,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:21:21,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171270884] [2024-11-12 07:21:21,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171270884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:21,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:21,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:21:21,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158782865] [2024-11-12 07:21:21,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:21,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:21:21,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:21:21,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:21:21,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:21:21,976 INFO L87 Difference]: Start difference. First operand 388 states and 548 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:21:22,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:22,480 INFO L93 Difference]: Finished difference Result 581 states and 826 transitions. [2024-11-12 07:21:22,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:21:22,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2024-11-12 07:21:22,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:22,483 INFO L225 Difference]: With dead ends: 581 [2024-11-12 07:21:22,483 INFO L226 Difference]: Without dead ends: 479 [2024-11-12 07:21:22,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:21:22,484 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 168 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:22,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 635 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:21:22,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-12 07:21:22,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 392. [2024-11-12 07:21:22,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 327 states have (on average 1.348623853211009) internal successors, (441), 329 states have internal predecessors, (441), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-12 07:21:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 553 transitions. [2024-11-12 07:21:22,531 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 553 transitions. Word has length 115 [2024-11-12 07:21:22,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:22,532 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 553 transitions. [2024-11-12 07:21:22,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:21:22,532 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 553 transitions. [2024-11-12 07:21:22,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 07:21:22,533 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:22,533 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:22,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-12 07:21:22,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:21:22,734 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:22,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:22,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1417211638, now seen corresponding path program 1 times [2024-11-12 07:21:22,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:21:22,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807458288] [2024-11-12 07:21:22,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:22,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:21:22,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:21:22,739 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:21:22,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 07:21:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:22,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 07:21:22,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:21:23,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:21:23,765 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 94 treesize of output 34 [2024-11-12 07:21:23,811 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-12 07:21:23,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:21:24,005 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 07:21:24,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:21:24,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807458288] [2024-11-12 07:21:24,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1807458288] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:21:24,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:21:24,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2024-11-12 07:21:24,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501671107] [2024-11-12 07:21:24,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:24,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:21:24,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:21:24,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:21:24,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:21:24,008 INFO L87 Difference]: Start difference. First operand 392 states and 553 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:21:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:24,251 INFO L93 Difference]: Finished difference Result 869 states and 1226 transitions. [2024-11-12 07:21:24,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:21:24,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-12 07:21:24,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:24,254 INFO L225 Difference]: With dead ends: 869 [2024-11-12 07:21:24,254 INFO L226 Difference]: Without dead ends: 574 [2024-11-12 07:21:24,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:21:24,257 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 136 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:24,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 473 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:21:24,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-12 07:21:24,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 561. [2024-11-12 07:21:24,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 474 states have (on average 1.3417721518987342) internal successors, (636), 479 states have internal predecessors, (636), 74 states have call successors, (74), 12 states have call predecessors, (74), 12 states have return successors, (74), 69 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-12 07:21:24,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 784 transitions. [2024-11-12 07:21:24,292 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 784 transitions. Word has length 116 [2024-11-12 07:21:24,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:24,293 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 784 transitions. [2024-11-12 07:21:24,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:21:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 784 transitions. [2024-11-12 07:21:24,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 07:21:24,296 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:24,296 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:24,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-12 07:21:24,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:21:24,497 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:24,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:24,497 INFO L85 PathProgramCache]: Analyzing trace with hash 407816570, now seen corresponding path program 1 times [2024-11-12 07:21:24,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:21:24,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359328498] [2024-11-12 07:21:24,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:24,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:21:24,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:21:24,500 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:21:24,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-12 07:21:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:24,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 07:21:24,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:21:24,698 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 19 treesize of output 11 [2024-11-12 07:21:24,771 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 07:21:24,771 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:21:24,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:21:24,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359328498] [2024-11-12 07:21:24,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1359328498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:24,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:24,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:21:24,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482665730] [2024-11-12 07:21:24,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:24,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:21:24,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:21:24,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:21:24,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:21:24,773 INFO L87 Difference]: Start difference. First operand 561 states and 784 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:21:25,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:25,936 INFO L93 Difference]: Finished difference Result 1136 states and 1586 transitions. [2024-11-12 07:21:25,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:21:25,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-12 07:21:25,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:25,942 INFO L225 Difference]: With dead ends: 1136 [2024-11-12 07:21:25,942 INFO L226 Difference]: Without dead ends: 696 [2024-11-12 07:21:25,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:21:25,949 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 75 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:25,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 419 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-12 07:21:25,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2024-11-12 07:21:25,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 592. [2024-11-12 07:21:25,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 503 states have (on average 1.3359840954274353) internal successors, (672), 508 states have internal predecessors, (672), 74 states have call successors, (74), 14 states have call predecessors, (74), 14 states have return successors, (74), 69 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-12 07:21:25,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 820 transitions. [2024-11-12 07:21:25,998 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 820 transitions. Word has length 116 [2024-11-12 07:21:25,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:25,998 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 820 transitions. [2024-11-12 07:21:25,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:21:25,999 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 820 transitions. [2024-11-12 07:21:25,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 07:21:25,999 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:26,000 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:26,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-12 07:21:26,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:21:26,201 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:26,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:26,201 INFO L85 PathProgramCache]: Analyzing trace with hash 14789560, now seen corresponding path program 1 times [2024-11-12 07:21:26,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:21:26,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210364126] [2024-11-12 07:21:26,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:26,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:21:26,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:21:26,212 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:21:26,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-12 07:21:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:26,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 07:21:26,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:21:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 07:21:26,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:21:26,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:21:26,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210364126] [2024-11-12 07:21:26,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1210364126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:26,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:26,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:21:26,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951008873] [2024-11-12 07:21:26,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:26,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:21:26,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:21:26,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:21:26,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:21:26,433 INFO L87 Difference]: Start difference. First operand 592 states and 820 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:21:26,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:26,506 INFO L93 Difference]: Finished difference Result 1108 states and 1544 transitions. [2024-11-12 07:21:26,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:21:26,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-12 07:21:26,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:26,510 INFO L225 Difference]: With dead ends: 1108 [2024-11-12 07:21:26,510 INFO L226 Difference]: Without dead ends: 616 [2024-11-12 07:21:26,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:21:26,512 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:26,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 483 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:21:26,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-12 07:21:26,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 616. [2024-11-12 07:21:26,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 527 states have (on average 1.3206831119544593) internal successors, (696), 532 states have internal predecessors, (696), 74 states have call successors, (74), 14 states have call predecessors, (74), 14 states have return successors, (74), 69 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-12 07:21:26,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 844 transitions. [2024-11-12 07:21:26,556 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 844 transitions. Word has length 116 [2024-11-12 07:21:26,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:26,557 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 844 transitions. [2024-11-12 07:21:26,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:21:26,557 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 844 transitions. [2024-11-12 07:21:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-12 07:21:26,558 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:26,559 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:26,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-12 07:21:26,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:21:26,760 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:26,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:26,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2103538353, now seen corresponding path program 1 times [2024-11-12 07:21:26,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:21:26,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204901687] [2024-11-12 07:21:26,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:26,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:21:26,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:21:26,764 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:21:26,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-12 07:21:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:27,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-12 07:21:27,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:21:27,260 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 15 treesize of output 1 [2024-11-12 07:21:27,942 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 31 treesize of output 26 [2024-11-12 07:21:28,640 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 0 case distinctions, treesize of input 39 treesize of output 37 [2024-11-12 07:21:31,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2024-11-12 07:21:31,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2024-11-12 07:21:31,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:21:31,351 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 88 treesize of output 48 [2024-11-12 07:21:31,419 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 8 proven. 172 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-12 07:21:31,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:21:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 07:21:31,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:21:31,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204901687] [2024-11-12 07:21:31,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204901687] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:21:31,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:21:31,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 20 [2024-11-12 07:21:31,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972029413] [2024-11-12 07:21:31,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:31,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:21:31,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:21:31,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:21:31,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2024-11-12 07:21:31,561 INFO L87 Difference]: Start difference. First operand 616 states and 844 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:21:31,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:31,809 INFO L93 Difference]: Finished difference Result 883 states and 1216 transitions. [2024-11-12 07:21:31,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:21:31,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-11-12 07:21:31,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:31,812 INFO L225 Difference]: With dead ends: 883 [2024-11-12 07:21:31,813 INFO L226 Difference]: Without dead ends: 626 [2024-11-12 07:21:31,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2024-11-12 07:21:31,814 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 45 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:31,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 682 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:21:31,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-11-12 07:21:31,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 612. [2024-11-12 07:21:31,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 523 states have (on average 1.3231357552581262) internal successors, (692), 528 states have internal predecessors, (692), 74 states have call successors, (74), 14 states have call predecessors, (74), 14 states have return successors, (74), 69 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-12 07:21:31,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 840 transitions. [2024-11-12 07:21:31,842 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 840 transitions. Word has length 117 [2024-11-12 07:21:31,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:31,842 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 840 transitions. [2024-11-12 07:21:31,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:21:31,843 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 840 transitions. [2024-11-12 07:21:31,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-12 07:21:31,843 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:31,844 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:31,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-12 07:21:32,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:21:32,044 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:32,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:32,045 INFO L85 PathProgramCache]: Analyzing trace with hash -185295277, now seen corresponding path program 1 times [2024-11-12 07:21:32,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:21:32,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898907824] [2024-11-12 07:21:32,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:32,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:21:32,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:21:32,049 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:21:32,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-12 07:21:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:32,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-12 07:21:32,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:21:32,396 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 21 treesize of output 9 [2024-11-12 07:21:34,139 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 18 treesize of output 10 [2024-11-12 07:21:36,902 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 143 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:21:36,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:21:37,658 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 07:21:37,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:21:37,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898907824] [2024-11-12 07:21:37,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [898907824] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:21:37,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:21:37,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 22 [2024-11-12 07:21:37,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603817363] [2024-11-12 07:21:37,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:37,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:21:37,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:21:37,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:21:37,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2024-11-12 07:21:37,660 INFO L87 Difference]: Start difference. First operand 612 states and 840 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:21:38,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:38,085 INFO L93 Difference]: Finished difference Result 1594 states and 2193 transitions. [2024-11-12 07:21:38,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:21:38,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-12 07:21:38,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:38,091 INFO L225 Difference]: With dead ends: 1594 [2024-11-12 07:21:38,091 INFO L226 Difference]: Without dead ends: 1083 [2024-11-12 07:21:38,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-11-12 07:21:38,093 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 126 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:38,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 396 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:21:38,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2024-11-12 07:21:38,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 823. [2024-11-12 07:21:38,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 734 states have (on average 1.3419618528610355) internal successors, (985), 739 states have internal predecessors, (985), 74 states have call successors, (74), 14 states have call predecessors, (74), 14 states have return successors, (74), 69 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-12 07:21:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1133 transitions. [2024-11-12 07:21:38,130 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1133 transitions. Word has length 118 [2024-11-12 07:21:38,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:38,131 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1133 transitions. [2024-11-12 07:21:38,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:21:38,131 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1133 transitions. [2024-11-12 07:21:38,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-12 07:21:38,132 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:38,132 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:38,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-12 07:21:38,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:21:38,335 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:38,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:38,335 INFO L85 PathProgramCache]: Analyzing trace with hash -994641903, now seen corresponding path program 1 times [2024-11-12 07:21:38,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:21:38,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169799093] [2024-11-12 07:21:38,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:38,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:21:38,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:21:38,338 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:21:38,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-12 07:21:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:38,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 07:21:38,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:21:38,608 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 12 treesize of output 8 [2024-11-12 07:21:38,645 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 37 treesize of output 25 [2024-11-12 07:21:38,668 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 07:21:38,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:21:38,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:21:38,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169799093] [2024-11-12 07:21:38,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169799093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:38,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:38,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:21:38,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385944413] [2024-11-12 07:21:38,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:38,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:21:38,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:21:38,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:21:38,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:21:38,671 INFO L87 Difference]: Start difference. First operand 823 states and 1133 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:21:38,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:38,814 INFO L93 Difference]: Finished difference Result 1728 states and 2378 transitions. [2024-11-12 07:21:38,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:21:38,814 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-12 07:21:38,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:38,817 INFO L225 Difference]: With dead ends: 1728 [2024-11-12 07:21:38,818 INFO L226 Difference]: Without dead ends: 1039 [2024-11-12 07:21:38,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:21:38,819 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 86 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:38,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 787 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:21:38,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2024-11-12 07:21:38,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1035. [2024-11-12 07:21:38,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 895 states have (on average 1.311731843575419) internal successors, (1174), 905 states have internal predecessors, (1174), 117 states have call successors, (117), 22 states have call predecessors, (117), 22 states have return successors, (117), 107 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-12 07:21:38,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1408 transitions. [2024-11-12 07:21:38,868 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1408 transitions. Word has length 118 [2024-11-12 07:21:38,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:38,868 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1408 transitions. [2024-11-12 07:21:38,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:21:38,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1408 transitions. [2024-11-12 07:21:38,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-12 07:21:38,869 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:38,869 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:38,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-12 07:21:39,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:21:39,070 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:39,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:39,071 INFO L85 PathProgramCache]: Analyzing trace with hash -434022304, now seen corresponding path program 1 times [2024-11-12 07:21:39,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:21:39,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746450887] [2024-11-12 07:21:39,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:39,072 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:21:39,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:21:39,073 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:21:39,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-12 07:21:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:39,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 07:21:39,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:21:39,305 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 12 treesize of output 8 [2024-11-12 07:21:39,338 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 37 treesize of output 25 [2024-11-12 07:21:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 07:21:39,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:21:39,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:21:39,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746450887] [2024-11-12 07:21:39,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746450887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:39,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:39,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:21:39,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162403210] [2024-11-12 07:21:39,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:39,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:21:39,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:21:39,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:21:39,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:21:39,379 INFO L87 Difference]: Start difference. First operand 1035 states and 1408 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:21:39,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:39,681 INFO L93 Difference]: Finished difference Result 1992 states and 2717 transitions. [2024-11-12 07:21:39,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:21:39,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-12 07:21:39,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:39,686 INFO L225 Difference]: With dead ends: 1992 [2024-11-12 07:21:39,686 INFO L226 Difference]: Without dead ends: 1164 [2024-11-12 07:21:39,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:21:39,688 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 48 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:39,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 660 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:21:39,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2024-11-12 07:21:39,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1073. [2024-11-12 07:21:39,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 933 states have (on average 1.3065380493033225) internal successors, (1219), 943 states have internal predecessors, (1219), 117 states have call successors, (117), 22 states have call predecessors, (117), 22 states have return successors, (117), 107 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-12 07:21:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1453 transitions. [2024-11-12 07:21:39,737 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1453 transitions. Word has length 118 [2024-11-12 07:21:39,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:39,737 INFO L471 AbstractCegarLoop]: Abstraction has 1073 states and 1453 transitions. [2024-11-12 07:21:39,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:21:39,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1453 transitions. [2024-11-12 07:21:39,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-12 07:21:39,739 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:39,739 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:39,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-12 07:21:39,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:21:39,943 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:39,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:39,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1020828318, now seen corresponding path program 1 times [2024-11-12 07:21:39,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:21:39,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29005509] [2024-11-12 07:21:39,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:39,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:21:39,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:21:39,949 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:21:39,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-12 07:21:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:40,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 07:21:40,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:21:40,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:21:40,225 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 95 treesize of output 35 [2024-11-12 07:21:41,020 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 07:21:41,021 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:21:41,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:21:41,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29005509] [2024-11-12 07:21:41,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29005509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:41,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:41,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:21:41,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383317604] [2024-11-12 07:21:41,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:41,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:21:41,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:21:41,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:21:41,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:21:41,023 INFO L87 Difference]: Start difference. First operand 1073 states and 1453 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:21:45,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 07:21:46,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 07:21:48,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 07:21:52,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 07:21:55,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 07:21:57,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 07:21:58,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 07:22:01,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 07:22:01,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:22:01,289 INFO L93 Difference]: Finished difference Result 1854 states and 2490 transitions. [2024-11-12 07:22:01,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:22:01,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-12 07:22:01,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:22:01,302 INFO L225 Difference]: With dead ends: 1854 [2024-11-12 07:22:01,302 INFO L226 Difference]: Without dead ends: 988 [2024-11-12 07:22:01,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:22:01,305 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 53 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:22:01,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 447 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 2 Unknown, 0 Unchecked, 20.1s Time] [2024-11-12 07:22:01,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2024-11-12 07:22:01,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 667. [2024-11-12 07:22:01,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 574 states have (on average 1.289198606271777) internal successors, (740), 577 states have internal predecessors, (740), 73 states have call successors, (73), 19 states have call predecessors, (73), 19 states have return successors, (73), 70 states have call predecessors, (73), 73 states have call successors, (73) [2024-11-12 07:22:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 886 transitions. [2024-11-12 07:22:01,360 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 886 transitions. Word has length 118 [2024-11-12 07:22:01,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:22:01,361 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 886 transitions. [2024-11-12 07:22:01,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:22:01,361 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 886 transitions. [2024-11-12 07:22:01,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-12 07:22:01,362 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:22:01,362 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:22:01,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-12 07:22:01,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:22:01,564 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:22:01,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:22:01,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1503648465, now seen corresponding path program 1 times [2024-11-12 07:22:01,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:22:01,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [44861969] [2024-11-12 07:22:01,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:01,565 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:22:01,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:22:01,568 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:22:01,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-12 07:22:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:01,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 07:22:01,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:22:03,096 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 21 treesize of output 21 [2024-11-12 07:22:03,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:22:03,307 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 66 treesize of output 42 [2024-11-12 07:22:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 07:22:03,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:22:03,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:22:03,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [44861969] [2024-11-12 07:22:03,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [44861969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:22:03,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:22:03,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:22:03,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448007017] [2024-11-12 07:22:03,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:22:03,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:22:03,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:22:03,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:22:03,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:22:03,354 INFO L87 Difference]: Start difference. First operand 667 states and 886 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:22:03,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:22:03,763 INFO L93 Difference]: Finished difference Result 1270 states and 1689 transitions. [2024-11-12 07:22:03,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:22:03,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-12 07:22:03,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:22:03,766 INFO L225 Difference]: With dead ends: 1270 [2024-11-12 07:22:03,766 INFO L226 Difference]: Without dead ends: 694 [2024-11-12 07:22:03,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:22:03,767 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 162 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:22:03,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 881 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:22:03,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-11-12 07:22:03,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 635. [2024-11-12 07:22:03,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 555 states have (on average 1.2882882882882882) internal successors, (715), 557 states have internal predecessors, (715), 61 states have call successors, (61), 18 states have call predecessors, (61), 18 states have return successors, (61), 59 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-12 07:22:03,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 837 transitions. [2024-11-12 07:22:03,804 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 837 transitions. Word has length 118 [2024-11-12 07:22:03,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:22:03,805 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 837 transitions. [2024-11-12 07:22:03,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 07:22:03,805 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 837 transitions. [2024-11-12 07:22:03,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-12 07:22:03,806 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:22:03,806 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:22:03,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-12 07:22:04,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:22:04,011 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:22:04,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:22:04,012 INFO L85 PathProgramCache]: Analyzing trace with hash 694301839, now seen corresponding path program 1 times [2024-11-12 07:22:04,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:22:04,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078458579] [2024-11-12 07:22:04,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:22:04,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:22:04,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:22:04,015 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:22:04,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-12 07:22:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:22:04,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-12 07:22:04,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:22:04,314 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 21 treesize of output 9 [2024-11-12 07:22:06,145 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 18 treesize of output 10